/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/goblint-regression/28-race_reach_42-trylock2_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 11:58:17,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 11:58:17,912 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 11:58:17,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 11:58:17,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 11:58:17,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 11:58:17,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 11:58:17,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 11:58:17,948 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 11:58:17,951 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 11:58:17,951 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 11:58:17,951 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 11:58:17,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 11:58:17,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 11:58:17,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 11:58:17,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 11:58:17,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 11:58:17,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 11:58:17,953 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 11:58:17,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 11:58:17,953 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 11:58:17,954 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 11:58:17,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 11:58:17,954 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 11:58:17,955 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 11:58:17,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:58:17,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 11:58:17,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 11:58:17,955 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 11:58:17,955 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 11:58:17,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 11:58:17,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 11:58:17,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 11:58:17,956 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 11:58:18,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 11:58:18,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 11:58:18,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 11:58:18,206 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 11:58:18,206 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 11:58:18,207 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_42-trylock2_racefree.i [2023-11-10 11:58:19,242 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 11:58:19,409 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 11:58:19,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_42-trylock2_racefree.i [2023-11-10 11:58:19,423 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3ba4d6c2/3984f4db30d548708bd0a9ebe0f68eef/FLAGd6eef7721 [2023-11-10 11:58:19,433 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3ba4d6c2/3984f4db30d548708bd0a9ebe0f68eef [2023-11-10 11:58:19,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 11:58:19,436 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 11:58:19,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 11:58:19,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 11:58:19,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 11:58:19,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:58:19" (1/1) ... [2023-11-10 11:58:19,440 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6803bd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:58:19, skipping insertion in model container [2023-11-10 11:58:19,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:58:19" (1/1) ... [2023-11-10 11:58:19,470 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 11:58:19,636 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_42-trylock2_racefree.i[30176,30189] [2023-11-10 11:58:19,651 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:58:19,660 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 11:58:19,679 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_42-trylock2_racefree.i[30176,30189] [2023-11-10 11:58:19,690 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:58:19,723 INFO L206 MainTranslator]: Completed translation [2023-11-10 11:58:19,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:58:19 WrapperNode [2023-11-10 11:58:19,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 11:58:19,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 11:58:19,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 11:58:19,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 11:58:19,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:58:19" (1/1) ... [2023-11-10 11:58:19,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:58:19" (1/1) ... [2023-11-10 11:58:19,751 INFO L138 Inliner]: procedures = 171, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 131 [2023-11-10 11:58:19,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 11:58:19,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 11:58:19,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 11:58:19,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 11:58:19,759 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:58:19" (1/1) ... [2023-11-10 11:58:19,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:58:19" (1/1) ... [2023-11-10 11:58:19,765 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:58:19" (1/1) ... [2023-11-10 11:58:19,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:58:19" (1/1) ... [2023-11-10 11:58:19,769 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:58:19" (1/1) ... [2023-11-10 11:58:19,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:58:19" (1/1) ... [2023-11-10 11:58:19,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:58:19" (1/1) ... [2023-11-10 11:58:19,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:58:19" (1/1) ... [2023-11-10 11:58:19,777 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 11:58:19,777 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 11:58:19,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 11:58:19,777 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 11:58:19,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:58:19" (1/1) ... [2023-11-10 11:58:19,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:58:19,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:58:19,826 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 11:58:19,861 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 11:58:19,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-10 11:58:19,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 11:58:19,892 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-10 11:58:19,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 11:58:19,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 11:58:19,892 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-10 11:58:19,892 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-10 11:58:19,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 11:58:19,892 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2023-11-10 11:58:19,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 11:58:19,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 11:58:19,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 11:58:19,894 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 11:58:20,000 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 11:58:20,001 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 11:58:20,247 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 11:58:20,255 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 11:58:20,255 INFO L302 CfgBuilder]: Removed 23 assume(true) statements. [2023-11-10 11:58:20,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:58:20 BoogieIcfgContainer [2023-11-10 11:58:20,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 11:58:20,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 11:58:20,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 11:58:20,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 11:58:20,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:58:19" (1/3) ... [2023-11-10 11:58:20,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6c81aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:58:20, skipping insertion in model container [2023-11-10 11:58:20,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:58:19" (2/3) ... [2023-11-10 11:58:20,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6c81aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:58:20, skipping insertion in model container [2023-11-10 11:58:20,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:58:20" (3/3) ... [2023-11-10 11:58:20,263 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_42-trylock2_racefree.i [2023-11-10 11:58:20,279 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 11:58:20,279 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-10 11:58:20,279 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 11:58:20,353 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-11-10 11:58:20,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 194 transitions, 395 flow [2023-11-10 11:58:20,477 INFO L124 PetriNetUnfolderBase]: 45/290 cut-off events. [2023-11-10 11:58:20,477 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-10 11:58:20,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 290 events. 45/290 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1139 event pairs, 0 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 154. Up to 6 conditions per place. [2023-11-10 11:58:20,486 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 194 transitions, 395 flow [2023-11-10 11:58:20,490 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 189 transitions, 382 flow [2023-11-10 11:58:20,496 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:58:20,500 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;@bcff26c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:58:20,500 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-10 11:58:20,512 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:58:20,512 INFO L124 PetriNetUnfolderBase]: 6/94 cut-off events. [2023-11-10 11:58:20,512 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:58:20,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:58:20,513 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] [2023-11-10 11:58:20,513 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:58:20,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:58:20,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1038419726, now seen corresponding path program 1 times [2023-11-10 11:58:20,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:58:20,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613406828] [2023-11-10 11:58:20,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:58:20,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:58:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:58:20,762 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 11:58:20,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:58:20,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613406828] [2023-11-10 11:58:20,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613406828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:58:20,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:58:20,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 11:58:20,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538842193] [2023-11-10 11:58:20,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:58:20,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:58:20,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:58:20,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:58:20,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:58:20,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 194 [2023-11-10 11:58:20,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 189 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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 11:58:20,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:58:20,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 194 [2023-11-10 11:58:20,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:58:20,871 INFO L124 PetriNetUnfolderBase]: 1/162 cut-off events. [2023-11-10 11:58:20,871 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:58:20,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 162 events. 1/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 143 event pairs, 0 based on Foata normal form. 59/214 useless extension candidates. Maximal degree in co-relation 130. Up to 8 conditions per place. [2023-11-10 11:58:20,874 INFO L140 encePairwiseOnDemand]: 164/194 looper letters, 9 selfloop transitions, 2 changer transitions 17/160 dead transitions. [2023-11-10 11:58:20,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 160 transitions, 348 flow [2023-11-10 11:58:20,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:58:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:58:20,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2023-11-10 11:58:20,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8745704467353952 [2023-11-10 11:58:20,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 509 transitions. [2023-11-10 11:58:20,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 509 transitions. [2023-11-10 11:58:20,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:58:20,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 509 transitions. [2023-11-10 11:58:20,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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 11:58:20,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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 11:58:20,896 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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 11:58:20,897 INFO L175 Difference]: Start difference. First operand has 164 places, 189 transitions, 382 flow. Second operand 3 states and 509 transitions. [2023-11-10 11:58:20,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 160 transitions, 348 flow [2023-11-10 11:58:20,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 160 transitions, 348 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:58:20,902 INFO L231 Difference]: Finished difference. Result has 163 places, 141 transitions, 294 flow [2023-11-10 11:58:20,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=294, PETRI_PLACES=163, PETRI_TRANSITIONS=141} [2023-11-10 11:58:20,905 INFO L281 CegarLoopForPetriNet]: 164 programPoint places, -1 predicate places. [2023-11-10 11:58:20,906 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 141 transitions, 294 flow [2023-11-10 11:58:20,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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 11:58:20,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:58:20,906 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:58:20,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 11:58:20,907 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:58:20,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:58:20,907 INFO L85 PathProgramCache]: Analyzing trace with hash -2057963942, now seen corresponding path program 1 times [2023-11-10 11:58:20,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:58:20,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359505760] [2023-11-10 11:58:20,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:58:20,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:58:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:58:20,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:58:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:58:21,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:58:21,007 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:58:21,008 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-10 11:58:21,009 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-10 11:58:21,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-11-10 11:58:21,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-11-10 11:58:21,010 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-10 11:58:21,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 11:58:21,010 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-11-10 11:58:21,012 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-10 11:58:21,012 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-10 11:58:21,052 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-10 11:58:21,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 212 places, 249 transitions, 514 flow [2023-11-10 11:58:21,096 INFO L124 PetriNetUnfolderBase]: 76/467 cut-off events. [2023-11-10 11:58:21,096 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-10 11:58:21,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 467 events. 76/467 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2093 event pairs, 0 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 292. Up to 9 conditions per place. [2023-11-10 11:58:21,099 INFO L82 GeneralOperation]: Start removeDead. Operand has 212 places, 249 transitions, 514 flow [2023-11-10 11:58:21,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 212 places, 249 transitions, 514 flow [2023-11-10 11:58:21,105 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:58:21,106 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;@bcff26c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:58:21,107 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-10 11:58:21,113 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:58:21,113 INFO L124 PetriNetUnfolderBase]: 6/94 cut-off events. [2023-11-10 11:58:21,113 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:58:21,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:58:21,113 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] [2023-11-10 11:58:21,113 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:58:21,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:58:21,114 INFO L85 PathProgramCache]: Analyzing trace with hash -192824370, now seen corresponding path program 1 times [2023-11-10 11:58:21,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:58:21,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272218593] [2023-11-10 11:58:21,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:58:21,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:58:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:58:21,184 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 11:58:21,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:58:21,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272218593] [2023-11-10 11:58:21,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272218593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:58:21,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:58:21,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 11:58:21,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255552400] [2023-11-10 11:58:21,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:58:21,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:58:21,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:58:21,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:58:21,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:58:21,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 249 [2023-11-10 11:58:21,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 249 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 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 11:58:21,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:58:21,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 249 [2023-11-10 11:58:21,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:58:21,282 INFO L124 PetriNetUnfolderBase]: 4/322 cut-off events. [2023-11-10 11:58:21,283 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-10 11:58:21,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 322 events. 4/322 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 789 event pairs, 0 based on Foata normal form. 184/490 useless extension candidates. Maximal degree in co-relation 232. Up to 22 conditions per place. [2023-11-10 11:58:21,284 INFO L140 encePairwiseOnDemand]: 207/249 looper letters, 12 selfloop transitions, 2 changer transitions 23/210 dead transitions. [2023-11-10 11:58:21,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 210 transitions, 470 flow [2023-11-10 11:58:21,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:58:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:58:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 649 transitions. [2023-11-10 11:58:21,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8688085676037484 [2023-11-10 11:58:21,294 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 649 transitions. [2023-11-10 11:58:21,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 649 transitions. [2023-11-10 11:58:21,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:58:21,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 649 transitions. [2023-11-10 11:58:21,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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 11:58:21,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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 11:58:21,298 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 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 11:58:21,298 INFO L175 Difference]: Start difference. First operand has 212 places, 249 transitions, 514 flow. Second operand 3 states and 649 transitions. [2023-11-10 11:58:21,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 210 transitions, 470 flow [2023-11-10 11:58:21,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 210 transitions, 470 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:58:21,304 INFO L231 Difference]: Finished difference. Result has 211 places, 184 transitions, 388 flow [2023-11-10 11:58:21,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=388, PETRI_PLACES=211, PETRI_TRANSITIONS=184} [2023-11-10 11:58:21,306 INFO L281 CegarLoopForPetriNet]: 212 programPoint places, -1 predicate places. [2023-11-10 11:58:21,306 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 184 transitions, 388 flow [2023-11-10 11:58:21,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 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 11:58:21,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:58:21,307 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] [2023-11-10 11:58:21,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 11:58:21,307 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:58:21,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:58:21,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1714636972, now seen corresponding path program 1 times [2023-11-10 11:58:21,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:58:21,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518532951] [2023-11-10 11:58:21,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:58:21,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:58:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:58:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:58:21,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:58:21,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518532951] [2023-11-10 11:58:21,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518532951] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:58:21,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879841799] [2023-11-10 11:58:21,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:58:21,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:58:21,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:58:21,477 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 11:58:21,478 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 11:58:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:58:21,566 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-10 11:58:21,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:58:21,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:58:21,652 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:58:21,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:58:21,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879841799] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:58:21,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:58:21,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-10 11:58:21,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215013735] [2023-11-10 11:58:21,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:58:21,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:58:21,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:58:21,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:58:21,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:58:21,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 249 [2023-11-10 11:58:21,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 184 transitions, 388 flow. Second operand has 10 states, 10 states have (on average 194.4) internal successors, (1944), 10 states have internal predecessors, (1944), 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 11:58:21,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:58:21,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 249 [2023-11-10 11:58:21,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:58:21,788 INFO L124 PetriNetUnfolderBase]: 0/140 cut-off events. [2023-11-10 11:58:21,788 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-10 11:58:21,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 140 events. 0/140 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 121 event pairs, 0 based on Foata normal form. 2/142 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2023-11-10 11:58:21,799 INFO L140 encePairwiseOnDemand]: 244/249 looper letters, 9 selfloop transitions, 7 changer transitions 0/134 dead transitions. [2023-11-10 11:58:21,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 134 transitions, 318 flow [2023-11-10 11:58:21,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:58:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:58:21,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1746 transitions. [2023-11-10 11:58:21,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7791164658634538 [2023-11-10 11:58:21,802 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1746 transitions. [2023-11-10 11:58:21,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1746 transitions. [2023-11-10 11:58:21,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:58:21,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1746 transitions. [2023-11-10 11:58:21,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 194.0) internal successors, (1746), 9 states have internal predecessors, (1746), 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 11:58:21,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 249.0) internal successors, (2490), 10 states have internal predecessors, (2490), 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 11:58:21,810 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 249.0) internal successors, (2490), 10 states have internal predecessors, (2490), 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 11:58:21,810 INFO L175 Difference]: Start difference. First operand has 211 places, 184 transitions, 388 flow. Second operand 9 states and 1746 transitions. [2023-11-10 11:58:21,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 134 transitions, 318 flow [2023-11-10 11:58:21,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 134 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-10 11:58:21,812 INFO L231 Difference]: Finished difference. Result has 142 places, 130 transitions, 290 flow [2023-11-10 11:58:21,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=290, PETRI_PLACES=142, PETRI_TRANSITIONS=130} [2023-11-10 11:58:21,829 INFO L281 CegarLoopForPetriNet]: 212 programPoint places, -70 predicate places. [2023-11-10 11:58:21,829 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 130 transitions, 290 flow [2023-11-10 11:58:21,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 194.4) internal successors, (1944), 10 states have internal predecessors, (1944), 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 11:58:21,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:58:21,830 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:58:21,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-10 11:58:22,035 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 11:58:22,036 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:58:22,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:58:22,036 INFO L85 PathProgramCache]: Analyzing trace with hash -603921373, now seen corresponding path program 1 times [2023-11-10 11:58:22,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:58:22,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240144191] [2023-11-10 11:58:22,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:58:22,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:58:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:58:22,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:58:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:58:22,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:58:22,073 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:58:22,074 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-10 11:58:22,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-10 11:58:22,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-11-10 11:58:22,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-11-10 11:58:22,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-10 11:58:22,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-10 11:58:22,074 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-10 11:58:22,075 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-10 11:58:22,075 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-10 11:58:22,125 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-10 11:58:22,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 256 places, 304 transitions, 635 flow [2023-11-10 11:58:22,234 INFO L124 PetriNetUnfolderBase]: 112/679 cut-off events. [2023-11-10 11:58:22,234 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-10 11:58:22,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 704 conditions, 679 events. 112/679 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3169 event pairs, 1 based on Foata normal form. 0/547 useless extension candidates. Maximal degree in co-relation 475. Up to 16 conditions per place. [2023-11-10 11:58:22,238 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 304 transitions, 635 flow [2023-11-10 11:58:22,243 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 256 places, 304 transitions, 635 flow [2023-11-10 11:58:22,244 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:58:22,245 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;@bcff26c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:58:22,245 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-10 11:58:22,251 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:58:22,251 INFO L124 PetriNetUnfolderBase]: 6/94 cut-off events. [2023-11-10 11:58:22,251 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:58:22,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:58:22,251 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] [2023-11-10 11:58:22,251 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:58:22,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:58:22,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1184530382, now seen corresponding path program 1 times [2023-11-10 11:58:22,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:58:22,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713138815] [2023-11-10 11:58:22,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:58:22,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:58:22,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:58:22,290 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 11:58:22,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:58:22,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713138815] [2023-11-10 11:58:22,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713138815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:58:22,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:58:22,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 11:58:22,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822000784] [2023-11-10 11:58:22,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:58:22,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:58:22,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:58:22,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:58:22,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:58:22,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 304 [2023-11-10 11:58:22,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 304 transitions, 635 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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 11:58:22,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:58:22,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 304 [2023-11-10 11:58:22,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:58:22,386 INFO L124 PetriNetUnfolderBase]: 10/500 cut-off events. [2023-11-10 11:58:22,386 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-11-10 11:58:22,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 500 events. 10/500 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1729 event pairs, 1 based on Foata normal form. 483/957 useless extension candidates. Maximal degree in co-relation 396. Up to 41 conditions per place. [2023-11-10 11:58:22,389 INFO L140 encePairwiseOnDemand]: 250/304 looper letters, 13 selfloop transitions, 2 changer transitions 24/253 dead transitions. [2023-11-10 11:58:22,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 253 transitions, 571 flow [2023-11-10 11:58:22,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:58:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:58:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 786 transitions. [2023-11-10 11:58:22,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8618421052631579 [2023-11-10 11:58:22,391 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 786 transitions. [2023-11-10 11:58:22,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 786 transitions. [2023-11-10 11:58:22,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:58:22,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 786 transitions. [2023-11-10 11:58:22,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 262.0) internal successors, (786), 3 states have internal predecessors, (786), 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 11:58:22,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 304.0) internal successors, (1216), 4 states have internal predecessors, (1216), 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 11:58:22,395 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 304.0) internal successors, (1216), 4 states have internal predecessors, (1216), 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 11:58:22,395 INFO L175 Difference]: Start difference. First operand has 256 places, 304 transitions, 635 flow. Second operand 3 states and 786 transitions. [2023-11-10 11:58:22,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 253 transitions, 571 flow [2023-11-10 11:58:22,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 253 transitions, 571 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:58:22,399 INFO L231 Difference]: Finished difference. Result has 255 places, 226 transitions, 480 flow [2023-11-10 11:58:22,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=255, PETRI_TRANSITIONS=226} [2023-11-10 11:58:22,401 INFO L281 CegarLoopForPetriNet]: 256 programPoint places, -1 predicate places. [2023-11-10 11:58:22,401 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 226 transitions, 480 flow [2023-11-10 11:58:22,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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 11:58:22,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:58:22,402 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] [2023-11-10 11:58:22,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-10 11:58:22,402 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:58:22,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:58:22,402 INFO L85 PathProgramCache]: Analyzing trace with hash 866369761, now seen corresponding path program 1 times [2023-11-10 11:58:22,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:58:22,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532198754] [2023-11-10 11:58:22,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:58:22,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:58:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:58:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:58:22,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:58:22,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532198754] [2023-11-10 11:58:22,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532198754] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:58:22,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801412793] [2023-11-10 11:58:22,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:58:22,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:58:22,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:58:22,503 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 11:58:22,549 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 11:58:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:58:22,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-10 11:58:22,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:58:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:58:22,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:58:22,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:58:22,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801412793] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:58:22,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:58:22,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-10 11:58:22,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018090826] [2023-11-10 11:58:22,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:58:22,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:58:22,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:58:22,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:58:22,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:58:22,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 304 [2023-11-10 11:58:22,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 226 transitions, 480 flow. Second operand has 10 states, 10 states have (on average 235.4) internal successors, (2354), 10 states have internal predecessors, (2354), 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 11:58:22,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:58:22,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 304 [2023-11-10 11:58:22,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:58:22,777 INFO L124 PetriNetUnfolderBase]: 1/247 cut-off events. [2023-11-10 11:58:22,778 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-10 11:58:22,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 247 events. 1/247 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 501 event pairs, 0 based on Foata normal form. 2/245 useless extension candidates. Maximal degree in co-relation 232. Up to 7 conditions per place. [2023-11-10 11:58:22,779 INFO L140 encePairwiseOnDemand]: 298/304 looper letters, 14 selfloop transitions, 9 changer transitions 0/236 dead transitions. [2023-11-10 11:58:22,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 236 transitions, 548 flow [2023-11-10 11:58:22,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:58:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:58:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2122 transitions. [2023-11-10 11:58:22,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7755847953216374 [2023-11-10 11:58:22,783 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2122 transitions. [2023-11-10 11:58:22,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2122 transitions. [2023-11-10 11:58:22,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:58:22,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2122 transitions. [2023-11-10 11:58:22,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 235.77777777777777) internal successors, (2122), 9 states have internal predecessors, (2122), 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 11:58:22,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 304.0) internal successors, (3040), 10 states have internal predecessors, (3040), 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 11:58:22,791 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 304.0) internal successors, (3040), 10 states have internal predecessors, (3040), 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 11:58:22,791 INFO L175 Difference]: Start difference. First operand has 255 places, 226 transitions, 480 flow. Second operand 9 states and 2122 transitions. [2023-11-10 11:58:22,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 236 transitions, 548 flow [2023-11-10 11:58:22,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 236 transitions, 544 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-10 11:58:22,795 INFO L231 Difference]: Finished difference. Result has 244 places, 232 transitions, 526 flow [2023-11-10 11:58:22,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=304, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=526, PETRI_PLACES=244, PETRI_TRANSITIONS=232} [2023-11-10 11:58:22,797 INFO L281 CegarLoopForPetriNet]: 256 programPoint places, -12 predicate places. [2023-11-10 11:58:22,797 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 232 transitions, 526 flow [2023-11-10 11:58:22,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 235.4) internal successors, (2354), 10 states have internal predecessors, (2354), 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 11:58:22,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:58:22,799 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:58:22,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-10 11:58:23,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-10 11:58:23,006 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:58:23,006 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:58:23,006 INFO L85 PathProgramCache]: Analyzing trace with hash -816704489, now seen corresponding path program 1 times [2023-11-10 11:58:23,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:58:23,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589427319] [2023-11-10 11:58:23,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:58:23,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:58:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:58:23,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:58:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:58:23,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:58:23,054 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:58:23,054 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-10 11:58:23,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-10 11:58:23,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-11-10 11:58:23,054 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-11-10 11:58:23,055 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-10 11:58:23,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-10 11:58:23,055 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-10 11:58:23,055 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-10 11:58:23,055 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-10 11:58:23,088 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-10 11:58:23,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 300 places, 359 transitions, 758 flow [2023-11-10 11:58:23,182 INFO L124 PetriNetUnfolderBase]: 160/963 cut-off events. [2023-11-10 11:58:23,182 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-10 11:58:23,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 963 events. 160/963 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4730 event pairs, 6 based on Foata normal form. 0/783 useless extension candidates. Maximal degree in co-relation 699. Up to 32 conditions per place. [2023-11-10 11:58:23,190 INFO L82 GeneralOperation]: Start removeDead. Operand has 300 places, 359 transitions, 758 flow [2023-11-10 11:58:23,200 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 300 places, 359 transitions, 758 flow [2023-11-10 11:58:23,201 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:58:23,201 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;@bcff26c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:58:23,201 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-10 11:58:23,206 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:58:23,206 INFO L124 PetriNetUnfolderBase]: 6/94 cut-off events. [2023-11-10 11:58:23,206 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:58:23,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:58:23,206 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] [2023-11-10 11:58:23,207 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:58:23,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:58:23,207 INFO L85 PathProgramCache]: Analyzing trace with hash 875516686, now seen corresponding path program 1 times [2023-11-10 11:58:23,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:58:23,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456242355] [2023-11-10 11:58:23,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:58:23,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:58:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:58:23,250 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 11:58:23,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:58:23,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456242355] [2023-11-10 11:58:23,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456242355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:58:23,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:58:23,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 11:58:23,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285558130] [2023-11-10 11:58:23,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:58:23,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:58:23,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:58:23,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:58:23,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:58:23,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 359 [2023-11-10 11:58:23,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 359 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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 11:58:23,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:58:23,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 359 [2023-11-10 11:58:23,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:58:23,407 INFO L124 PetriNetUnfolderBase]: 24/746 cut-off events. [2023-11-10 11:58:23,408 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-11-10 11:58:23,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 746 events. 24/746 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3199 event pairs, 6 based on Foata normal form. 1145/1851 useless extension candidates. Maximal degree in co-relation 606. Up to 76 conditions per place. [2023-11-10 11:58:23,413 INFO L140 encePairwiseOnDemand]: 293/359 looper letters, 14 selfloop transitions, 2 changer transitions 25/296 dead transitions. [2023-11-10 11:58:23,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 296 transitions, 674 flow [2023-11-10 11:58:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:58:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:58:23,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 923 transitions. [2023-11-10 11:58:23,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8570102135561746 [2023-11-10 11:58:23,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 923 transitions. [2023-11-10 11:58:23,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 923 transitions. [2023-11-10 11:58:23,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:58:23,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 923 transitions. [2023-11-10 11:58:23,417 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 307.6666666666667) internal successors, (923), 3 states have internal predecessors, (923), 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 11:58:23,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 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 11:58:23,419 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 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 11:58:23,419 INFO L175 Difference]: Start difference. First operand has 300 places, 359 transitions, 758 flow. Second operand 3 states and 923 transitions. [2023-11-10 11:58:23,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 296 transitions, 674 flow [2023-11-10 11:58:23,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 296 transitions, 674 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:58:23,423 INFO L231 Difference]: Finished difference. Result has 299 places, 268 transitions, 574 flow [2023-11-10 11:58:23,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=299, PETRI_TRANSITIONS=268} [2023-11-10 11:58:23,424 INFO L281 CegarLoopForPetriNet]: 300 programPoint places, -1 predicate places. [2023-11-10 11:58:23,424 INFO L495 AbstractCegarLoop]: Abstraction has has 299 places, 268 transitions, 574 flow [2023-11-10 11:58:23,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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 11:58:23,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:58:23,424 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] [2023-11-10 11:58:23,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-10 11:58:23,424 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:58:23,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:58:23,425 INFO L85 PathProgramCache]: Analyzing trace with hash 2005150390, now seen corresponding path program 1 times [2023-11-10 11:58:23,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:58:23,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671049895] [2023-11-10 11:58:23,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:58:23,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:58:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:58:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:58:23,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:58:23,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671049895] [2023-11-10 11:58:23,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671049895] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:58:23,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129462901] [2023-11-10 11:58:23,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:58:23,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:58:23,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:58:23,475 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 11:58:23,525 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 11:58:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:58:23,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-10 11:58:23,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:58:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:58:23,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:58:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:58:23,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129462901] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:58:23,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:58:23,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-10 11:58:23,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179818032] [2023-11-10 11:58:23,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:58:23,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:58:23,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:58:23,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:58:23,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:58:23,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 359 [2023-11-10 11:58:23,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 268 transitions, 574 flow. Second operand has 10 states, 10 states have (on average 276.4) internal successors, (2764), 10 states have internal predecessors, (2764), 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 11:58:23,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:58:23,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 359 [2023-11-10 11:58:23,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:58:23,782 INFO L124 PetriNetUnfolderBase]: 2/354 cut-off events. [2023-11-10 11:58:23,782 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-10 11:58:23,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 354 events. 2/354 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1066 event pairs, 0 based on Foata normal form. 2/348 useless extension candidates. Maximal degree in co-relation 354. Up to 11 conditions per place. [2023-11-10 11:58:23,784 INFO L140 encePairwiseOnDemand]: 353/359 looper letters, 15 selfloop transitions, 9 changer transitions 0/278 dead transitions. [2023-11-10 11:58:23,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 278 transitions, 644 flow [2023-11-10 11:58:23,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:58:23,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:58:23,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2492 transitions. [2023-11-10 11:58:23,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7712782420303311 [2023-11-10 11:58:23,788 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2492 transitions. [2023-11-10 11:58:23,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2492 transitions. [2023-11-10 11:58:23,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:58:23,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2492 transitions. [2023-11-10 11:58:23,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 276.8888888888889) internal successors, (2492), 9 states have internal predecessors, (2492), 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 11:58:23,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 359.0) internal successors, (3590), 10 states have internal predecessors, (3590), 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 11:58:23,797 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 359.0) internal successors, (3590), 10 states have internal predecessors, (3590), 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 11:58:23,797 INFO L175 Difference]: Start difference. First operand has 299 places, 268 transitions, 574 flow. Second operand 9 states and 2492 transitions. [2023-11-10 11:58:23,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 278 transitions, 644 flow [2023-11-10 11:58:23,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 278 transitions, 636 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-10 11:58:23,803 INFO L231 Difference]: Finished difference. Result has 288 places, 274 transitions, 616 flow [2023-11-10 11:58:23,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=616, PETRI_PLACES=288, PETRI_TRANSITIONS=274} [2023-11-10 11:58:23,803 INFO L281 CegarLoopForPetriNet]: 300 programPoint places, -12 predicate places. [2023-11-10 11:58:23,803 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 274 transitions, 616 flow [2023-11-10 11:58:23,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 276.4) internal successors, (2764), 10 states have internal predecessors, (2764), 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 11:58:23,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:58:23,805 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:58:23,811 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 11:58:24,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:58:24,011 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:58:24,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:58:24,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1352061129, now seen corresponding path program 1 times [2023-11-10 11:58:24,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:58:24,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603165090] [2023-11-10 11:58:24,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:58:24,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:58:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:58:24,115 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-10 11:58:24,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:58:24,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603165090] [2023-11-10 11:58:24,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603165090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:58:24,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:58:24,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-10 11:58:24,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822107311] [2023-11-10 11:58:24,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:58:24,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-10 11:58:24,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:58:24,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-10 11:58:24,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-10 11:58:24,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 359 [2023-11-10 11:58:24,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 274 transitions, 616 flow. Second operand has 5 states, 5 states have (on average 240.6) internal successors, (1203), 5 states have internal predecessors, (1203), 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 11:58:24,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:58:24,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 359 [2023-11-10 11:58:24,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:58:53,854 INFO L124 PetriNetUnfolderBase]: 87363/240973 cut-off events. [2023-11-10 11:58:53,855 INFO L125 PetriNetUnfolderBase]: For 645/645 co-relation queries the response was YES. [2023-11-10 11:58:55,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 357580 conditions, 240973 events. 87363/240973 cut-off events. For 645/645 co-relation queries the response was YES. Maximal size of possible extension queue 6246. Compared 3656271 event pairs, 49598 based on Foata normal form. 750/236920 useless extension candidates. Maximal degree in co-relation 235597. Up to 68877 conditions per place. [2023-11-10 11:58:57,233 INFO L140 encePairwiseOnDemand]: 337/359 looper letters, 119 selfloop transitions, 39 changer transitions 5/391 dead transitions. [2023-11-10 11:58:57,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 391 transitions, 1191 flow [2023-11-10 11:58:57,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:58:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:58:57,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2320 transitions. [2023-11-10 11:58:57,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7180439492417209 [2023-11-10 11:58:57,238 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2320 transitions. [2023-11-10 11:58:57,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2320 transitions. [2023-11-10 11:58:57,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:58:57,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2320 transitions. [2023-11-10 11:58:57,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 257.77777777777777) internal successors, (2320), 9 states have internal predecessors, (2320), 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 11:58:57,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 359.0) internal successors, (3590), 10 states have internal predecessors, (3590), 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 11:58:57,246 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 359.0) internal successors, (3590), 10 states have internal predecessors, (3590), 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 11:58:57,246 INFO L175 Difference]: Start difference. First operand has 288 places, 274 transitions, 616 flow. Second operand 9 states and 2320 transitions. [2023-11-10 11:58:57,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 391 transitions, 1191 flow [2023-11-10 11:58:57,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 391 transitions, 1185 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-10 11:58:57,252 INFO L231 Difference]: Finished difference. Result has 302 places, 308 transitions, 890 flow [2023-11-10 11:58:57,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=890, PETRI_PLACES=302, PETRI_TRANSITIONS=308} [2023-11-10 11:58:57,253 INFO L281 CegarLoopForPetriNet]: 300 programPoint places, 2 predicate places. [2023-11-10 11:58:57,253 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 308 transitions, 890 flow [2023-11-10 11:58:57,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 240.6) internal successors, (1203), 5 states have internal predecessors, (1203), 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 11:58:57,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:58:57,254 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:58:57,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-10 11:58:57,254 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:58:57,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:58:57,255 INFO L85 PathProgramCache]: Analyzing trace with hash 749464918, now seen corresponding path program 1 times [2023-11-10 11:58:57,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:58:57,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745486266] [2023-11-10 11:58:57,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:58:57,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:58:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:58:57,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:58:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:58:57,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:58:57,282 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:58:57,282 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-11-10 11:58:57,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-10 11:58:57,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2023-11-10 11:58:57,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2023-11-10 11:58:57,282 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-10 11:58:57,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-10 11:58:57,282 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-10 11:58:57,283 WARN L233 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-10 11:58:57,283 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-10 11:58:57,310 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2023-11-10 11:58:57,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 344 places, 414 transitions, 883 flow [2023-11-10 11:58:57,519 INFO L124 PetriNetUnfolderBase]: 236/1395 cut-off events. [2023-11-10 11:58:57,519 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2023-11-10 11:58:57,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 1395 events. 236/1395 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7433 event pairs, 23 based on Foata normal form. 0/1151 useless extension candidates. Maximal degree in co-relation 1008. Up to 80 conditions per place. [2023-11-10 11:58:57,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 344 places, 414 transitions, 883 flow [2023-11-10 11:58:57,544 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 344 places, 414 transitions, 883 flow [2023-11-10 11:58:57,545 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:58:57,545 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;@bcff26c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:58:57,545 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-10 11:58:57,548 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:58:57,548 INFO L124 PetriNetUnfolderBase]: 6/94 cut-off events. [2023-11-10 11:58:57,548 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:58:57,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:58:57,549 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] [2023-11-10 11:58:57,549 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:58:57,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:58:57,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1119865458, now seen corresponding path program 1 times [2023-11-10 11:58:57,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:58:57,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255118533] [2023-11-10 11:58:57,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:58:57,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:58:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:58:57,569 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 11:58:57,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:58:57,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255118533] [2023-11-10 11:58:57,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255118533] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:58:57,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:58:57,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-10 11:58:57,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562015009] [2023-11-10 11:58:57,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:58:57,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:58:57,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:58:57,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:58:57,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:58:57,571 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 414 [2023-11-10 11:58:57,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 414 transitions, 883 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 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 11:58:57,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:58:57,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 414 [2023-11-10 11:58:57,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:58:57,763 INFO L124 PetriNetUnfolderBase]: 58/1132 cut-off events. [2023-11-10 11:58:57,764 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2023-11-10 11:58:57,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 1132 events. 58/1132 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5779 event pairs, 23 based on Foata normal form. 2572/3642 useless extension candidates. Maximal degree in co-relation 913. Up to 147 conditions per place. [2023-11-10 11:58:57,775 INFO L140 encePairwiseOnDemand]: 336/414 looper letters, 15 selfloop transitions, 2 changer transitions 26/339 dead transitions. [2023-11-10 11:58:57,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 339 transitions, 779 flow [2023-11-10 11:58:57,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:58:57,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:58:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1060 transitions. [2023-11-10 11:58:57,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8534621578099839 [2023-11-10 11:58:57,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1060 transitions. [2023-11-10 11:58:57,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1060 transitions. [2023-11-10 11:58:57,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:58:57,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1060 transitions. [2023-11-10 11:58:57,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 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 11:58:57,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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 11:58:57,787 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 414.0) internal successors, (1656), 4 states have internal predecessors, (1656), 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 11:58:57,787 INFO L175 Difference]: Start difference. First operand has 344 places, 414 transitions, 883 flow. Second operand 3 states and 1060 transitions. [2023-11-10 11:58:57,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 339 transitions, 779 flow [2023-11-10 11:58:57,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 339 transitions, 779 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 11:58:57,792 INFO L231 Difference]: Finished difference. Result has 343 places, 310 transitions, 670 flow [2023-11-10 11:58:57,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=343, PETRI_TRANSITIONS=310} [2023-11-10 11:58:57,793 INFO L281 CegarLoopForPetriNet]: 344 programPoint places, -1 predicate places. [2023-11-10 11:58:57,793 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 310 transitions, 670 flow [2023-11-10 11:58:57,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 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 11:58:57,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:58:57,794 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] [2023-11-10 11:58:57,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-10 11:58:57,794 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:58:57,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:58:57,794 INFO L85 PathProgramCache]: Analyzing trace with hash 836011563, now seen corresponding path program 1 times [2023-11-10 11:58:57,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:58:57,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407864463] [2023-11-10 11:58:57,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:58:57,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:58:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:58:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:58:57,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:58:57,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407864463] [2023-11-10 11:58:57,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407864463] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 11:58:57,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120680782] [2023-11-10 11:58:57,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:58:57,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:58:57,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:58:57,841 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 11:58:57,843 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 11:58:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:58:57,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-10 11:58:57,929 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 11:58:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:58:57,949 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 11:58:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 11:58:57,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120680782] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 11:58:57,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 11:58:57,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-11-10 11:58:57,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830770841] [2023-11-10 11:58:57,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 11:58:57,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 11:58:57,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:58:57,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 11:58:57,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-10 11:58:57,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 414 [2023-11-10 11:58:57,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 310 transitions, 670 flow. Second operand has 10 states, 10 states have (on average 317.4) internal successors, (3174), 10 states have internal predecessors, (3174), 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 11:58:57,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:58:57,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 414 [2023-11-10 11:58:57,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:58:58,076 INFO L124 PetriNetUnfolderBase]: 3/461 cut-off events. [2023-11-10 11:58:58,076 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-11-10 11:58:58,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 461 events. 3/461 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1651 event pairs, 0 based on Foata normal form. 2/451 useless extension candidates. Maximal degree in co-relation 477. Up to 15 conditions per place. [2023-11-10 11:58:58,080 INFO L140 encePairwiseOnDemand]: 408/414 looper letters, 16 selfloop transitions, 9 changer transitions 0/320 dead transitions. [2023-11-10 11:58:58,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 320 transitions, 742 flow [2023-11-10 11:58:58,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:58:58,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:58:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2862 transitions. [2023-11-10 11:58:58,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7681159420289855 [2023-11-10 11:58:58,085 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2862 transitions. [2023-11-10 11:58:58,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2862 transitions. [2023-11-10 11:58:58,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:58:58,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2862 transitions. [2023-11-10 11:58:58,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 318.0) internal successors, (2862), 9 states have internal predecessors, (2862), 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 11:58:58,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 414.0) internal successors, (4140), 10 states have internal predecessors, (4140), 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 11:58:58,093 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 414.0) internal successors, (4140), 10 states have internal predecessors, (4140), 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 11:58:58,093 INFO L175 Difference]: Start difference. First operand has 343 places, 310 transitions, 670 flow. Second operand 9 states and 2862 transitions. [2023-11-10 11:58:58,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 320 transitions, 742 flow [2023-11-10 11:58:58,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 320 transitions, 728 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-10 11:58:58,097 INFO L231 Difference]: Finished difference. Result has 332 places, 316 transitions, 706 flow [2023-11-10 11:58:58,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=414, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=706, PETRI_PLACES=332, PETRI_TRANSITIONS=316} [2023-11-10 11:58:58,098 INFO L281 CegarLoopForPetriNet]: 344 programPoint places, -12 predicate places. [2023-11-10 11:58:58,098 INFO L495 AbstractCegarLoop]: Abstraction has has 332 places, 316 transitions, 706 flow [2023-11-10 11:58:58,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 317.4) internal successors, (3174), 10 states have internal predecessors, (3174), 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 11:58:58,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:58:58,099 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:58:58,104 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 11:58:58,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 11:58:58,304 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2023-11-10 11:58:58,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:58:58,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1991892120, now seen corresponding path program 1 times [2023-11-10 11:58:58,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:58:58,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430667120] [2023-11-10 11:58:58,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:58:58,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:58:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:58:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-10 11:58:58,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:58:58,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430667120] [2023-11-10 11:58:58,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430667120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:58:58,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:58:58,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-10 11:58:58,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503358604] [2023-11-10 11:58:58,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:58:58,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-10 11:58:58,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:58:58,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-10 11:58:58,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-10 11:58:58,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 414 [2023-11-10 11:58:58,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 316 transitions, 706 flow. Second operand has 5 states, 5 states have (on average 277.6) internal successors, (1388), 5 states have internal predecessors, (1388), 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 11:58:58,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:58:58,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 414 [2023-11-10 11:58:58,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand