/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_02-simple_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:02:00,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:02:00,447 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-12-09 15:02:00,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:02:00,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:02:00,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:02:00,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:02:00,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:02:00,481 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:02:00,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:02:00,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:02:00,484 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:02:00,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:02:00,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:02:00,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:02:00,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:02:00,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:02:00,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:02:00,486 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:02:00,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:02:00,487 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:02:00,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:02:00,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:02:00,488 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:02:00,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:02:00,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:02:00,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:02:00,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:02:00,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:02:00,489 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:02:00,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:02:00,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:02:00,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:02:00,490 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-12-09 15:02:00,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:02:00,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:02:00,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:02:00,687 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:02:00,687 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:02:00,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_02-simple_racefree.i [2023-12-09 15:02:01,791 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:02:02,015 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:02:02,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_02-simple_racefree.i [2023-12-09 15:02:02,031 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1e4799df/7dba23c53c614e99ae5819e91a98f688/FLAGd4fca3f4a [2023-12-09 15:02:02,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1e4799df/7dba23c53c614e99ae5819e91a98f688 [2023-12-09 15:02:02,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:02:02,050 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:02:02,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:02:02,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:02:02,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:02:02,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:02:02" (1/1) ... [2023-12-09 15:02:02,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@693eec63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:02, skipping insertion in model container [2023-12-09 15:02:02,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:02:02" (1/1) ... [2023-12-09 15:02:02,150 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:02:02,364 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_02-simple_racefree.i[30176,30189] [2023-12-09 15:02:02,376 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:02:02,384 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:02:02,418 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_02-simple_racefree.i[30176,30189] [2023-12-09 15:02:02,422 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:02:02,448 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:02:02,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:02 WrapperNode [2023-12-09 15:02:02,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:02:02,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:02:02,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:02:02,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:02:02,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:02" (1/1) ... [2023-12-09 15:02:02,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:02" (1/1) ... [2023-12-09 15:02:02,486 INFO L138 Inliner]: procedures = 171, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2023-12-09 15:02:02,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:02:02,487 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:02:02,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:02:02,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:02:02,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:02" (1/1) ... [2023-12-09 15:02:02,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:02" (1/1) ... [2023-12-09 15:02:02,504 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:02" (1/1) ... [2023-12-09 15:02:02,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:02" (1/1) ... [2023-12-09 15:02:02,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:02" (1/1) ... [2023-12-09 15:02:02,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:02" (1/1) ... [2023-12-09 15:02:02,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:02" (1/1) ... [2023-12-09 15:02:02,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:02" (1/1) ... [2023-12-09 15:02:02,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:02:02,514 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:02:02,514 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:02:02,514 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:02:02,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:02" (1/1) ... [2023-12-09 15:02:02,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:02:02,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:02:02,538 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-12-09 15:02:02,549 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-12-09 15:02:02,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:02:02,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:02:02,564 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-09 15:02:02,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:02:02,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:02:02,565 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-09 15:02:02,565 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-09 15:02:02,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:02:02,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:02:02,566 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-09 15:02:02,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:02:02,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:02:02,567 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 15:02:02,660 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:02:02,661 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:02:02,787 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:02:02,820 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:02:02,821 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-12-09 15:02:02,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:02:02 BoogieIcfgContainer [2023-12-09 15:02:02,822 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:02:02,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:02:02,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:02:02,826 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:02:02,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:02:02" (1/3) ... [2023-12-09 15:02:02,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eaf3fcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:02:02, skipping insertion in model container [2023-12-09 15:02:02,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:02:02" (2/3) ... [2023-12-09 15:02:02,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eaf3fcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:02:02, skipping insertion in model container [2023-12-09 15:02:02,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:02:02" (3/3) ... [2023-12-09 15:02:02,828 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_02-simple_racefree.i [2023-12-09 15:02:02,843 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:02:02,844 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:02:02,844 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:02:02,903 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-09 15:02:02,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 118 transitions, 243 flow [2023-12-09 15:02:03,011 INFO L124 PetriNetUnfolderBase]: 17/158 cut-off events. [2023-12-09 15:02:03,011 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-09 15:02:03,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 158 events. 17/158 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 375 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 76. Up to 4 conditions per place. [2023-12-09 15:02:03,016 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 118 transitions, 243 flow [2023-12-09 15:02:03,020 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 113 transitions, 230 flow [2023-12-09 15:02:03,035 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:02:03,041 INFO L362 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=true, 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;@3f5a4df0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:02:03,042 INFO L363 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-09 15:02:03,082 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:02:03,083 INFO L124 PetriNetUnfolderBase]: 3/76 cut-off events. [2023-12-09 15:02:03,083 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:02:03,083 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:03,083 INFO L233 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] [2023-12-09 15:02:03,084 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:03,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:03,088 INFO L85 PathProgramCache]: Analyzing trace with hash 511502963, now seen corresponding path program 1 times [2023-12-09 15:02:03,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:03,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464244485] [2023-12-09 15:02:03,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:03,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:03,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:02:03,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464244485] [2023-12-09 15:02:03,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464244485] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:02:03,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:02:03,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:02:03,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246749590] [2023-12-09 15:02:03,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:02:03,331 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:02:03,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:02:03,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:02:03,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:02:03,356 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 118 [2023-12-09 15:02:03,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 113 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 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-12-09 15:02:03,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:02:03,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 118 [2023-12-09 15:02:03,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:02:03,486 INFO L124 PetriNetUnfolderBase]: 66/417 cut-off events. [2023-12-09 15:02:03,487 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:02:03,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 417 events. 66/417 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2000 event pairs, 6 based on Foata normal form. 69/457 useless extension candidates. Maximal degree in co-relation 519. Up to 132 conditions per place. [2023-12-09 15:02:03,493 INFO L140 encePairwiseOnDemand]: 104/118 looper letters, 23 selfloop transitions, 2 changer transitions 16/109 dead transitions. [2023-12-09 15:02:03,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 109 transitions, 278 flow [2023-12-09 15:02:03,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:02:03,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:02:03,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 302 transitions. [2023-12-09 15:02:03,508 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8531073446327684 [2023-12-09 15:02:03,508 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 302 transitions. [2023-12-09 15:02:03,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 302 transitions. [2023-12-09 15:02:03,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:02:03,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 302 transitions. [2023-12-09 15:02:03,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-12-09 15:02:03,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 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-12-09 15:02:03,521 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 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-12-09 15:02:03,524 INFO L308 CegarLoopForPetriNet]: 105 programPoint places, 1 predicate places. [2023-12-09 15:02:03,524 INFO L500 AbstractCegarLoop]: Abstraction has has 106 places, 109 transitions, 278 flow [2023-12-09 15:02:03,524 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 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-12-09 15:02:03,525 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:03,525 INFO L233 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, 1, 1] [2023-12-09 15:02:03,525 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:02:03,526 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:03,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:03,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1069964030, now seen corresponding path program 1 times [2023-12-09 15:02:03,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:03,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873768372] [2023-12-09 15:02:03,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:03,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:02:03,561 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 15:02:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:02:03,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 15:02:03,608 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 15:02:03,609 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-09 15:02:03,611 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-09 15:02:03,611 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:02:03,611 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1] [2023-12-09 15:02:03,613 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 15:02:03,613 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-09 15:02:03,641 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-09 15:02:03,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 151 transitions, 318 flow [2023-12-09 15:02:03,675 INFO L124 PetriNetUnfolderBase]: 31/257 cut-off events. [2023-12-09 15:02:03,676 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-09 15:02:03,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 257 events. 31/257 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 759 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 160. Up to 8 conditions per place. [2023-12-09 15:02:03,678 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 151 transitions, 318 flow [2023-12-09 15:02:03,680 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 151 transitions, 318 flow [2023-12-09 15:02:03,682 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:02:03,683 INFO L362 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=true, 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;@3f5a4df0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:02:03,683 INFO L363 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-09 15:02:03,689 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:02:03,689 INFO L124 PetriNetUnfolderBase]: 3/76 cut-off events. [2023-12-09 15:02:03,690 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:02:03,690 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:03,690 INFO L233 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] [2023-12-09 15:02:03,690 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:03,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:03,690 INFO L85 PathProgramCache]: Analyzing trace with hash 267142291, now seen corresponding path program 1 times [2023-12-09 15:02:03,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:03,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823196338] [2023-12-09 15:02:03,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:03,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:03,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:03,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:02:03,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823196338] [2023-12-09 15:02:03,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823196338] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:02:03,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:02:03,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:02:03,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453641083] [2023-12-09 15:02:03,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:02:03,793 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:02:03,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:02:03,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:02:03,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:02:03,794 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 151 [2023-12-09 15:02:03,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 151 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-12-09 15:02:03,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:02:03,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 151 [2023-12-09 15:02:03,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:02:04,267 INFO L124 PetriNetUnfolderBase]: 1058/3734 cut-off events. [2023-12-09 15:02:04,268 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2023-12-09 15:02:04,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5527 conditions, 3734 events. 1058/3734 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 32962 event pairs, 480 based on Foata normal form. 887/4346 useless extension candidates. Maximal degree in co-relation 700. Up to 1728 conditions per place. [2023-12-09 15:02:04,282 INFO L140 encePairwiseOnDemand]: 131/151 looper letters, 32 selfloop transitions, 2 changer transitions 22/143 dead transitions. [2023-12-09 15:02:04,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 143 transitions, 380 flow [2023-12-09 15:02:04,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:02:04,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:02:04,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-12-09 15:02:04,284 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8300220750551877 [2023-12-09 15:02:04,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-12-09 15:02:04,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-12-09 15:02:04,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:02:04,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-12-09 15:02:04,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 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-12-09 15:02:04,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 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-12-09 15:02:04,291 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 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-12-09 15:02:04,295 INFO L308 CegarLoopForPetriNet]: 137 programPoint places, 1 predicate places. [2023-12-09 15:02:04,296 INFO L500 AbstractCegarLoop]: Abstraction has has 138 places, 143 transitions, 380 flow [2023-12-09 15:02:04,296 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-12-09 15:02:04,296 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:04,296 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:02:04,296 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:02:04,296 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:04,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:04,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1383293379, now seen corresponding path program 1 times [2023-12-09 15:02:04,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:04,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067541817] [2023-12-09 15:02:04,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:04,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:04,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:02:04,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067541817] [2023-12-09 15:02:04,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067541817] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:02:04,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774716530] [2023-12-09 15:02:04,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:04,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:02:04,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:02:04,381 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-12-09 15:02:04,411 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-12-09 15:02:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:04,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:02:04,540 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:02:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:04,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:02:04,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:04,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774716530] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:02:04,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:02:04,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 15:02:04,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464351032] [2023-12-09 15:02:04,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:02:04,638 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:02:04,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:02:04,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:02:04,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:02:04,639 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 151 [2023-12-09 15:02:04,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 143 transitions, 380 flow. Second operand has 10 states, 10 states have (on average 105.6) internal successors, (1056), 10 states have internal predecessors, (1056), 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-12-09 15:02:04,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:02:04,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 151 [2023-12-09 15:02:04,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:02:04,858 INFO L124 PetriNetUnfolderBase]: 492/1280 cut-off events. [2023-12-09 15:02:04,859 INFO L125 PetriNetUnfolderBase]: For 336/525 co-relation queries the response was YES. [2023-12-09 15:02:04,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2916 conditions, 1280 events. 492/1280 cut-off events. For 336/525 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 8425 event pairs, 0 based on Foata normal form. 6/1272 useless extension candidates. Maximal degree in co-relation 383. Up to 754 conditions per place. [2023-12-09 15:02:04,867 INFO L140 encePairwiseOnDemand]: 146/151 looper letters, 75 selfloop transitions, 7 changer transitions 0/158 dead transitions. [2023-12-09 15:02:04,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 158 transitions, 650 flow [2023-12-09 15:02:04,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:02:04,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:02:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1011 transitions. [2023-12-09 15:02:04,869 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7439293598233996 [2023-12-09 15:02:04,869 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1011 transitions. [2023-12-09 15:02:04,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1011 transitions. [2023-12-09 15:02:04,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:02:04,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1011 transitions. [2023-12-09 15:02:04,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 112.33333333333333) internal successors, (1011), 9 states have internal predecessors, (1011), 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-12-09 15:02:04,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 151.0) internal successors, (1510), 10 states have internal predecessors, (1510), 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-12-09 15:02:04,874 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 151.0) internal successors, (1510), 10 states have internal predecessors, (1510), 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-12-09 15:02:04,876 INFO L308 CegarLoopForPetriNet]: 137 programPoint places, -25 predicate places. [2023-12-09 15:02:04,876 INFO L500 AbstractCegarLoop]: Abstraction has has 112 places, 158 transitions, 650 flow [2023-12-09 15:02:04,877 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 105.6) internal successors, (1056), 10 states have internal predecessors, (1056), 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-12-09 15:02:04,877 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:04,877 INFO L233 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, 1, 1] [2023-12-09 15:02:04,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-09 15:02:05,082 WARN L482 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-12-09 15:02:05,083 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:05,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:05,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1225920435, now seen corresponding path program 1 times [2023-12-09 15:02:05,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:05,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224907541] [2023-12-09 15:02:05,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:05,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:02:05,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 15:02:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:02:05,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 15:02:05,133 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 15:02:05,133 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-09 15:02:05,133 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-09 15:02:05,134 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:02:05,134 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 15:02:05,134 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 15:02:05,134 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-09 15:02:05,188 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-09 15:02:05,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 184 transitions, 395 flow [2023-12-09 15:02:05,216 INFO L124 PetriNetUnfolderBase]: 50/391 cut-off events. [2023-12-09 15:02:05,216 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-12-09 15:02:05,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 391 events. 50/391 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1300 event pairs, 1 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 265. Up to 16 conditions per place. [2023-12-09 15:02:05,219 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 184 transitions, 395 flow [2023-12-09 15:02:05,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 184 transitions, 395 flow [2023-12-09 15:02:05,222 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:02:05,222 INFO L362 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=true, 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;@3f5a4df0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:02:05,222 INFO L363 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-09 15:02:05,226 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:02:05,226 INFO L124 PetriNetUnfolderBase]: 3/76 cut-off events. [2023-12-09 15:02:05,226 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:02:05,226 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:05,226 INFO L233 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] [2023-12-09 15:02:05,226 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:05,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:05,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1761318291, now seen corresponding path program 1 times [2023-12-09 15:02:05,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:05,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129066316] [2023-12-09 15:02:05,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:05,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:05,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:02:05,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129066316] [2023-12-09 15:02:05,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129066316] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:02:05,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:02:05,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:02:05,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50018167] [2023-12-09 15:02:05,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:02:05,264 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:02:05,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:02:05,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:02:05,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:02:05,266 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 184 [2023-12-09 15:02:05,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 184 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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-12-09 15:02:05,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:02:05,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 184 [2023-12-09 15:02:05,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:02:08,748 INFO L124 PetriNetUnfolderBase]: 11851/31789 cut-off events. [2023-12-09 15:02:08,748 INFO L125 PetriNetUnfolderBase]: For 877/877 co-relation queries the response was YES. [2023-12-09 15:02:08,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49074 conditions, 31789 events. 11851/31789 cut-off events. For 877/877 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 369458 event pairs, 7555 based on Foata normal form. 9252/40050 useless extension candidates. Maximal degree in co-relation 5611. Up to 16847 conditions per place. [2023-12-09 15:02:08,939 INFO L140 encePairwiseOnDemand]: 158/184 looper letters, 39 selfloop transitions, 2 changer transitions 23/170 dead transitions. [2023-12-09 15:02:08,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 170 transitions, 461 flow [2023-12-09 15:02:08,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:02:08,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:02:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2023-12-09 15:02:08,941 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8097826086956522 [2023-12-09 15:02:08,941 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2023-12-09 15:02:08,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2023-12-09 15:02:08,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:02:08,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2023-12-09 15:02:08,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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-12-09 15:02:08,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 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-12-09 15:02:08,944 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 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-12-09 15:02:08,945 INFO L308 CegarLoopForPetriNet]: 165 programPoint places, 1 predicate places. [2023-12-09 15:02:08,946 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 170 transitions, 461 flow [2023-12-09 15:02:08,946 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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-12-09 15:02:08,946 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:08,946 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:02:08,946 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:02:08,946 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:08,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:08,947 INFO L85 PathProgramCache]: Analyzing trace with hash 530728930, now seen corresponding path program 1 times [2023-12-09 15:02:08,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:08,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340141096] [2023-12-09 15:02:08,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:08,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:09,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:09,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:02:09,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340141096] [2023-12-09 15:02:09,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340141096] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:02:09,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782404986] [2023-12-09 15:02:09,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:09,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:02:09,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:02:09,046 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-12-09 15:02:09,074 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-12-09 15:02:09,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:09,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:02:09,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:02:09,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:09,159 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:02:09,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:09,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782404986] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:02:09,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:02:09,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 15:02:09,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819001807] [2023-12-09 15:02:09,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:02:09,198 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:02:09,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:02:09,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:02:09,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:02:09,201 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 184 [2023-12-09 15:02:09,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 170 transitions, 461 flow. Second operand has 10 states, 10 states have (on average 124.6) internal successors, (1246), 10 states have internal predecessors, (1246), 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-12-09 15:02:09,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:02:09,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 184 [2023-12-09 15:02:09,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:02:12,363 INFO L124 PetriNetUnfolderBase]: 12227/30811 cut-off events. [2023-12-09 15:02:12,364 INFO L125 PetriNetUnfolderBase]: For 6612/10094 co-relation queries the response was YES. [2023-12-09 15:02:12,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65557 conditions, 30811 events. 12227/30811 cut-off events. For 6612/10094 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 336939 event pairs, 905 based on Foata normal form. 6/29007 useless extension candidates. Maximal degree in co-relation 7240. Up to 16943 conditions per place. [2023-12-09 15:02:12,595 INFO L140 encePairwiseOnDemand]: 178/184 looper letters, 106 selfloop transitions, 9 changer transitions 23/243 dead transitions. [2023-12-09 15:02:12,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 243 transitions, 991 flow [2023-12-09 15:02:12,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:02:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:02:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1221 transitions. [2023-12-09 15:02:12,597 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7373188405797102 [2023-12-09 15:02:12,598 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1221 transitions. [2023-12-09 15:02:12,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1221 transitions. [2023-12-09 15:02:12,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:02:12,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1221 transitions. [2023-12-09 15:02:12,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 135.66666666666666) internal successors, (1221), 9 states have internal predecessors, (1221), 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-12-09 15:02:12,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 184.0) internal successors, (1840), 10 states have internal predecessors, (1840), 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-12-09 15:02:12,604 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 184.0) internal successors, (1840), 10 states have internal predecessors, (1840), 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-12-09 15:02:12,605 INFO L308 CegarLoopForPetriNet]: 165 programPoint places, 9 predicate places. [2023-12-09 15:02:12,606 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 243 transitions, 991 flow [2023-12-09 15:02:12,606 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 124.6) internal successors, (1246), 10 states have internal predecessors, (1246), 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-12-09 15:02:12,606 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:12,606 INFO L233 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, 1, 1] [2023-12-09 15:02:12,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-09 15:02:12,812 WARN L482 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-12-09 15:02:12,812 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:12,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:12,812 INFO L85 PathProgramCache]: Analyzing trace with hash -130980165, now seen corresponding path program 1 times [2023-12-09 15:02:12,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:12,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739099199] [2023-12-09 15:02:12,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:12,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:02:12,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-09 15:02:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-09 15:02:12,866 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-09 15:02:12,866 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-09 15:02:12,866 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-09 15:02:12,866 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-09 15:02:12,866 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 15:02:12,866 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-09 15:02:12,867 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-09 15:02:12,867 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-09 15:02:12,896 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-09 15:02:12,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 217 transitions, 474 flow [2023-12-09 15:02:12,939 INFO L124 PetriNetUnfolderBase]: 81/597 cut-off events. [2023-12-09 15:02:12,939 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-12-09 15:02:12,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 597 events. 81/597 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2317 event pairs, 6 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 411. Up to 32 conditions per place. [2023-12-09 15:02:12,945 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 217 transitions, 474 flow [2023-12-09 15:02:12,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 217 transitions, 474 flow [2023-12-09 15:02:12,948 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:02:12,949 INFO L362 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=true, 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;@3f5a4df0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:02:12,949 INFO L363 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-09 15:02:12,952 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:02:12,952 INFO L124 PetriNetUnfolderBase]: 3/76 cut-off events. [2023-12-09 15:02:12,952 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-09 15:02:12,952 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:12,952 INFO L233 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] [2023-12-09 15:02:12,952 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:12,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:12,952 INFO L85 PathProgramCache]: Analyzing trace with hash 699063667, now seen corresponding path program 1 times [2023-12-09 15:02:12,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:12,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564856797] [2023-12-09 15:02:12,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:12,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:12,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:02:12,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564856797] [2023-12-09 15:02:12,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564856797] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:02:12,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:02:12,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:02:12,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874633663] [2023-12-09 15:02:12,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:02:12,998 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:02:12,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:02:12,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:02:12,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:02:12,999 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 217 [2023-12-09 15:02:12,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 217 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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-12-09 15:02:12,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:02:12,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 217 [2023-12-09 15:02:12,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:02:46,410 INFO L124 PetriNetUnfolderBase]: 116073/263817 cut-off events. [2023-12-09 15:02:46,410 INFO L125 PetriNetUnfolderBase]: For 11989/11989 co-relation queries the response was YES. [2023-12-09 15:02:48,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420501 conditions, 263817 events. 116073/263817 cut-off events. For 11989/11989 co-relation queries the response was YES. Maximal size of possible extension queue 5664. Compared 3589460 event pairs, 84882 based on Foata normal form. 87589/344429 useless extension candidates. Maximal degree in co-relation 49707. Up to 152541 conditions per place. [2023-12-09 15:02:49,124 INFO L140 encePairwiseOnDemand]: 185/217 looper letters, 46 selfloop transitions, 2 changer transitions 24/197 dead transitions. [2023-12-09 15:02:49,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 197 transitions, 544 flow [2023-12-09 15:02:49,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:02:49,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:02:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2023-12-09 15:02:49,126 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7956989247311828 [2023-12-09 15:02:49,126 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2023-12-09 15:02:49,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2023-12-09 15:02:49,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:02:49,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2023-12-09 15:02:49,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 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-12-09 15:02:49,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 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-12-09 15:02:49,128 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 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-12-09 15:02:49,128 INFO L308 CegarLoopForPetriNet]: 193 programPoint places, 1 predicate places. [2023-12-09 15:02:49,129 INFO L500 AbstractCegarLoop]: Abstraction has has 194 places, 197 transitions, 544 flow [2023-12-09 15:02:49,129 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 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-12-09 15:02:49,129 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:02:49,129 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:02:49,129 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-09 15:02:49,129 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:02:49,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:02:49,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1346317951, now seen corresponding path program 1 times [2023-12-09 15:02:49,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:02:49,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742815678] [2023-12-09 15:02:49,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:49,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:02:49,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:49,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:02:49,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742815678] [2023-12-09 15:02:49,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742815678] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:02:49,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818287452] [2023-12-09 15:02:49,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:02:49,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:02:49,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:02:49,196 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-12-09 15:02:49,198 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-12-09 15:02:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:02:49,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-09 15:02:49,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:02:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:49,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:02:49,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:02:49,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818287452] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:02:49,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:02:49,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-09 15:02:49,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352904274] [2023-12-09 15:02:49,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:02:49,417 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-09 15:02:49,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:02:49,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-09 15:02:49,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-09 15:02:49,418 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 217 [2023-12-09 15:02:49,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 197 transitions, 544 flow. Second operand has 10 states, 10 states have (on average 143.6) internal successors, (1436), 10 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-12-09 15:02:49,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:02:49,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 217 [2023-12-09 15:02:49,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand