/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 06:24:23,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 06:24:23,881 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-VariableLbe.epf [2023-08-25 06:24:23,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 06:24:23,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 06:24:23,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 06:24:23,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 06:24:23,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 06:24:23,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 06:24:23,920 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 06:24:23,920 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 06:24:23,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 06:24:23,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 06:24:23,921 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 06:24:23,921 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 06:24:23,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 06:24:23,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 06:24:23,922 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 06:24:23,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 06:24:23,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 06:24:23,922 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 06:24:23,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 06:24:23,925 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 06:24:23,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 06:24:23,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 06:24:23,928 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 06:24:23,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 06:24:23,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 06:24:23,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 06:24:23,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 06:24:23,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 06:24:23,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 06:24:23,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 06:24:23,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 06:24:23,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 06:24:23,930 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 06:24:24,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 06:24:24,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 06:24:24,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 06:24:24,196 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 06:24:24,197 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 06:24:24,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2023-08-25 06:24:25,117 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 06:24:25,283 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 06:24:25,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-dec-subseq.wvr.c [2023-08-25 06:24:25,289 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40db90635/7c0c2b637c6a457b92c2ceceeea6b533/FLAG17ad5cfc1 [2023-08-25 06:24:25,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40db90635/7c0c2b637c6a457b92c2ceceeea6b533 [2023-08-25 06:24:25,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 06:24:25,299 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 06:24:25,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 06:24:25,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 06:24:25,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 06:24:25,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 06:24:25" (1/1) ... [2023-08-25 06:24:25,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@496063c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:24:25, skipping insertion in model container [2023-08-25 06:24:25,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 06:24:25" (1/1) ... [2023-08-25 06:24:25,316 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 06:24:25,442 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 06:24:25,448 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 06:24:25,471 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 06:24:25,476 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 06:24:25,476 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 06:24:25,480 INFO L206 MainTranslator]: Completed translation [2023-08-25 06:24:25,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:24:25 WrapperNode [2023-08-25 06:24:25,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 06:24:25,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 06:24:25,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 06:24:25,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 06:24:25,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:24:25" (1/1) ... [2023-08-25 06:24:25,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:24:25" (1/1) ... [2023-08-25 06:24:25,537 INFO L138 Inliner]: procedures = 24, calls = 46, calls flagged for inlining = 12, calls inlined = 14, statements flattened = 428 [2023-08-25 06:24:25,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 06:24:25,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 06:24:25,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 06:24:25,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 06:24:25,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:24:25" (1/1) ... [2023-08-25 06:24:25,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:24:25" (1/1) ... [2023-08-25 06:24:25,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:24:25" (1/1) ... [2023-08-25 06:24:25,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:24:25" (1/1) ... [2023-08-25 06:24:25,581 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:24:25" (1/1) ... [2023-08-25 06:24:25,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:24:25" (1/1) ... [2023-08-25 06:24:25,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:24:25" (1/1) ... [2023-08-25 06:24:25,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:24:25" (1/1) ... [2023-08-25 06:24:25,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 06:24:25,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 06:24:25,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 06:24:25,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 06:24:25,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:24:25" (1/1) ... [2023-08-25 06:24:25,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 06:24:25,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 06:24:25,629 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-08-25 06:24:25,648 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-08-25 06:24:25,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 06:24:25,657 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 06:24:25,657 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 06:24:25,657 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 06:24:25,657 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 06:24:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 06:24:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 06:24:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 06:24:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-25 06:24:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-25 06:24:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-25 06:24:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 06:24:25,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 06:24:25,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 06:24:25,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 06:24:25,660 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 06:24:25,774 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 06:24:25,777 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 06:24:26,308 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 06:24:26,512 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 06:24:26,512 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-25 06:24:26,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 06:24:26 BoogieIcfgContainer [2023-08-25 06:24:26,515 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 06:24:26,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 06:24:26,517 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 06:24:26,519 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 06:24:26,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 06:24:25" (1/3) ... [2023-08-25 06:24:26,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f18ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 06:24:26, skipping insertion in model container [2023-08-25 06:24:26,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:24:25" (2/3) ... [2023-08-25 06:24:26,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f18ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 06:24:26, skipping insertion in model container [2023-08-25 06:24:26,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 06:24:26" (3/3) ... [2023-08-25 06:24:26,520 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-dec-subseq.wvr.c [2023-08-25 06:24:26,532 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 06:24:26,532 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2023-08-25 06:24:26,532 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 06:24:26,645 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-25 06:24:26,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 368 places, 377 transitions, 770 flow [2023-08-25 06:24:26,798 INFO L124 PetriNetUnfolderBase]: 16/375 cut-off events. [2023-08-25 06:24:26,798 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 06:24:26,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 375 events. 16/375 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 622 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 280. Up to 2 conditions per place. [2023-08-25 06:24:26,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 368 places, 377 transitions, 770 flow [2023-08-25 06:24:26,811 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 357 places, 366 transitions, 744 flow [2023-08-25 06:24:26,818 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 06:24:26,824 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 357 places, 366 transitions, 744 flow [2023-08-25 06:24:26,826 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 357 places, 366 transitions, 744 flow [2023-08-25 06:24:26,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 357 places, 366 transitions, 744 flow [2023-08-25 06:24:26,874 INFO L124 PetriNetUnfolderBase]: 16/366 cut-off events. [2023-08-25 06:24:26,875 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 06:24:26,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 366 events. 16/366 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 621 event pairs, 0 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 280. Up to 2 conditions per place. [2023-08-25 06:24:26,882 INFO L119 LiptonReduction]: Number of co-enabled transitions 11388 [2023-08-25 06:24:38,960 INFO L134 LiptonReduction]: Checked pairs total: 60421 [2023-08-25 06:24:38,960 INFO L136 LiptonReduction]: Total number of compositions: 429 [2023-08-25 06:24:38,973 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 06:24:38,979 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=LoopsAndPotentialCycles, 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;@5f0472c2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 06:24:38,979 INFO L358 AbstractCegarLoop]: Starting to check reachability of 120 error locations. [2023-08-25 06:24:38,980 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 06:24:38,980 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 06:24:38,980 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 06:24:38,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:24:38,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 06:24:38,981 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 06:24:38,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:24:38,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1773, now seen corresponding path program 1 times [2023-08-25 06:24:38,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:24:38,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041583805] [2023-08-25 06:24:38,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:24:38,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:24:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:24:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 06:24:39,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:24:39,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041583805] [2023-08-25 06:24:39,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041583805] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:24:39,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:24:39,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 06:24:39,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567867159] [2023-08-25 06:24:39,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:24:39,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 06:24:39,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:24:39,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 06:24:39,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 06:24:39,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 806 [2023-08-25 06:24:39,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 119 transitions, 250 flow. Second operand has 2 states, 2 states have (on average 325.5) internal successors, (651), 2 states have internal predecessors, (651), 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-08-25 06:24:39,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:24:39,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 806 [2023-08-25 06:24:39,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:24:39,220 INFO L124 PetriNetUnfolderBase]: 133/441 cut-off events. [2023-08-25 06:24:39,221 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-25 06:24:39,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 441 events. 133/441 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2276 event pairs, 93 based on Foata normal form. 38/402 useless extension candidates. Maximal degree in co-relation 615. Up to 227 conditions per place. [2023-08-25 06:24:39,223 INFO L140 encePairwiseOnDemand]: 744/806 looper letters, 26 selfloop transitions, 0 changer transitions 0/57 dead transitions. [2023-08-25 06:24:39,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 178 flow [2023-08-25 06:24:39,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 06:24:39,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 06:24:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 738 transitions. [2023-08-25 06:24:39,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45781637717121587 [2023-08-25 06:24:39,237 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 738 transitions. [2023-08-25 06:24:39,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 738 transitions. [2023-08-25 06:24:39,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:24:39,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 738 transitions. [2023-08-25 06:24:39,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 369.0) internal successors, (738), 2 states have internal predecessors, (738), 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-08-25 06:24:39,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 806.0) internal successors, (2418), 3 states have internal predecessors, (2418), 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-08-25 06:24:39,251 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 806.0) internal successors, (2418), 3 states have internal predecessors, (2418), 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-08-25 06:24:39,253 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 250 flow. Second operand 2 states and 738 transitions. [2023-08-25 06:24:39,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 178 flow [2023-08-25 06:24:39,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 57 transitions, 170 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 06:24:39,257 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 118 flow [2023-08-25 06:24:39,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=118, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2023-08-25 06:24:39,260 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -64 predicate places. [2023-08-25 06:24:39,260 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 118 flow [2023-08-25 06:24:39,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 325.5) internal successors, (651), 2 states have internal predecessors, (651), 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-08-25 06:24:39,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:24:39,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-25 06:24:39,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 06:24:39,261 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 06:24:39,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:24:39,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1805276190, now seen corresponding path program 1 times [2023-08-25 06:24:39,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:24:39,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256845066] [2023-08-25 06:24:39,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:24:39,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:24:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:24:39,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 06:24:39,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:24:39,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256845066] [2023-08-25 06:24:39,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256845066] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:24:39,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:24:39,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 06:24:39,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961206348] [2023-08-25 06:24:39,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:24:39,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 06:24:39,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:24:39,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 06:24:39,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 06:24:39,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 806 [2023-08-25 06:24:39,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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-08-25 06:24:39,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:24:39,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 806 [2023-08-25 06:24:39,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:24:39,523 INFO L124 PetriNetUnfolderBase]: 198/505 cut-off events. [2023-08-25 06:24:39,523 INFO L125 PetriNetUnfolderBase]: For 5/18 co-relation queries the response was YES. [2023-08-25 06:24:39,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 505 events. 198/505 cut-off events. For 5/18 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2297 event pairs, 69 based on Foata normal form. 1/448 useless extension candidates. Maximal degree in co-relation 855. Up to 311 conditions per place. [2023-08-25 06:24:39,526 INFO L140 encePairwiseOnDemand]: 799/806 looper letters, 34 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2023-08-25 06:24:39,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 205 flow [2023-08-25 06:24:39,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 06:24:39,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 06:24:39,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 989 transitions. [2023-08-25 06:24:39,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40901571546732834 [2023-08-25 06:24:39,533 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 989 transitions. [2023-08-25 06:24:39,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 989 transitions. [2023-08-25 06:24:39,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:24:39,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 989 transitions. [2023-08-25 06:24:39,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 329.6666666666667) internal successors, (989), 3 states have internal predecessors, (989), 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-08-25 06:24:39,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 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-08-25 06:24:39,541 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 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-08-25 06:24:39,541 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 118 flow. Second operand 3 states and 989 transitions. [2023-08-25 06:24:39,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 205 flow [2023-08-25 06:24:39,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 205 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 06:24:39,543 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 136 flow [2023-08-25 06:24:39,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2023-08-25 06:24:39,545 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -64 predicate places. [2023-08-25 06:24:39,546 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 136 flow [2023-08-25 06:24:39,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 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-08-25 06:24:39,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:24:39,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 06:24:39,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 06:24:39,550 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 06:24:39,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:24:39,561 INFO L85 PathProgramCache]: Analyzing trace with hash -296328895, now seen corresponding path program 1 times [2023-08-25 06:24:39,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:24:39,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442623889] [2023-08-25 06:24:39,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:24:39,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:24:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:24:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 06:24:39,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:24:39,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442623889] [2023-08-25 06:24:39,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442623889] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:24:39,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:24:39,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 06:24:39,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21097104] [2023-08-25 06:24:39,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:24:39,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 06:24:39,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:24:39,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 06:24:39,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 06:24:39,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 806 [2023-08-25 06:24:39,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 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-08-25 06:24:39,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:24:39,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 806 [2023-08-25 06:24:39,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:24:39,708 INFO L124 PetriNetUnfolderBase]: 162/464 cut-off events. [2023-08-25 06:24:39,708 INFO L125 PetriNetUnfolderBase]: For 50/86 co-relation queries the response was YES. [2023-08-25 06:24:39,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 464 events. 162/464 cut-off events. For 50/86 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2185 event pairs, 115 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 819. Up to 268 conditions per place. [2023-08-25 06:24:39,710 INFO L140 encePairwiseOnDemand]: 804/806 looper letters, 28 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2023-08-25 06:24:39,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 56 transitions, 192 flow [2023-08-25 06:24:39,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 06:24:39,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 06:24:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 967 transitions. [2023-08-25 06:24:39,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3999172870140612 [2023-08-25 06:24:39,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 967 transitions. [2023-08-25 06:24:39,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 967 transitions. [2023-08-25 06:24:39,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:24:39,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 967 transitions. [2023-08-25 06:24:39,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 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-08-25 06:24:39,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 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-08-25 06:24:39,718 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 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-08-25 06:24:39,718 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 136 flow. Second operand 3 states and 967 transitions. [2023-08-25 06:24:39,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 56 transitions, 192 flow [2023-08-25 06:24:39,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 06:24:39,720 INFO L231 Difference]: Finished difference. Result has 56 places, 56 transitions, 132 flow [2023-08-25 06:24:39,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2023-08-25 06:24:39,720 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -64 predicate places. [2023-08-25 06:24:39,721 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 56 transitions, 132 flow [2023-08-25 06:24:39,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 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-08-25 06:24:39,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:24:39,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 06:24:39,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 06:24:39,722 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 06:24:39,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:24:39,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2117193164, now seen corresponding path program 1 times [2023-08-25 06:24:39,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:24:39,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492032970] [2023-08-25 06:24:39,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:24:39,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:24:39,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:24:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 06:24:40,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:24:40,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492032970] [2023-08-25 06:24:40,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492032970] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:24:40,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:24:40,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 06:24:40,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224798027] [2023-08-25 06:24:40,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:24:40,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 06:24:40,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:24:40,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 06:24:40,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 06:24:40,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 806 [2023-08-25 06:24:40,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 56 transitions, 132 flow. Second operand has 6 states, 6 states have (on average 278.8333333333333) internal successors, (1673), 6 states have internal predecessors, (1673), 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-08-25 06:24:40,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:24:40,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 806 [2023-08-25 06:24:40,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:24:40,527 INFO L124 PetriNetUnfolderBase]: 928/1508 cut-off events. [2023-08-25 06:24:40,527 INFO L125 PetriNetUnfolderBase]: For 254/254 co-relation queries the response was YES. [2023-08-25 06:24:40,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3273 conditions, 1508 events. 928/1508 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6679 event pairs, 87 based on Foata normal form. 0/1270 useless extension candidates. Maximal degree in co-relation 3268. Up to 524 conditions per place. [2023-08-25 06:24:40,533 INFO L140 encePairwiseOnDemand]: 801/806 looper letters, 143 selfloop transitions, 4 changer transitions 0/155 dead transitions. [2023-08-25 06:24:40,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 155 transitions, 664 flow [2023-08-25 06:24:40,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 06:24:40,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 06:24:40,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1800 transitions. [2023-08-25 06:24:40,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37220843672456577 [2023-08-25 06:24:40,537 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1800 transitions. [2023-08-25 06:24:40,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1800 transitions. [2023-08-25 06:24:40,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:24:40,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1800 transitions. [2023-08-25 06:24:40,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 300.0) internal successors, (1800), 6 states have internal predecessors, (1800), 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-08-25 06:24:40,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 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-08-25 06:24:40,547 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 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-08-25 06:24:40,547 INFO L175 Difference]: Start difference. First operand has 56 places, 56 transitions, 132 flow. Second operand 6 states and 1800 transitions. [2023-08-25 06:24:40,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 155 transitions, 664 flow [2023-08-25 06:24:40,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 155 transitions, 663 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 06:24:40,550 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 137 flow [2023-08-25 06:24:40,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=137, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2023-08-25 06:24:40,551 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -61 predicate places. [2023-08-25 06:24:40,551 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 137 flow [2023-08-25 06:24:40,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 278.8333333333333) internal successors, (1673), 6 states have internal predecessors, (1673), 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-08-25 06:24:40,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:24:40,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 06:24:40,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 06:24:40,552 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 06:24:40,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:24:40,552 INFO L85 PathProgramCache]: Analyzing trace with hash -978371210, now seen corresponding path program 1 times [2023-08-25 06:24:40,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:24:40,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178717628] [2023-08-25 06:24:40,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:24:40,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:24:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:24:40,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 06:24:40,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:24:40,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178717628] [2023-08-25 06:24:40,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178717628] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:24:40,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:24:40,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 06:24:40,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034184813] [2023-08-25 06:24:40,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:24:40,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 06:24:40,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:24:40,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 06:24:40,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 06:24:40,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 806 [2023-08-25 06:24:40,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 270.4) internal successors, (1352), 5 states have internal predecessors, (1352), 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-08-25 06:24:40,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:24:40,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 806 [2023-08-25 06:24:40,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:24:40,756 INFO L124 PetriNetUnfolderBase]: 317/594 cut-off events. [2023-08-25 06:24:40,757 INFO L125 PetriNetUnfolderBase]: For 165/172 co-relation queries the response was YES. [2023-08-25 06:24:40,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 594 events. 317/594 cut-off events. For 165/172 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2161 event pairs, 229 based on Foata normal form. 1/500 useless extension candidates. Maximal degree in co-relation 1352. Up to 492 conditions per place. [2023-08-25 06:24:40,759 INFO L140 encePairwiseOnDemand]: 801/806 looper letters, 44 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2023-08-25 06:24:40,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 63 transitions, 256 flow [2023-08-25 06:24:40,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 06:24:40,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 06:24:40,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1387 transitions. [2023-08-25 06:24:40,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34416873449131513 [2023-08-25 06:24:40,762 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1387 transitions. [2023-08-25 06:24:40,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1387 transitions. [2023-08-25 06:24:40,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:24:40,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1387 transitions. [2023-08-25 06:24:40,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 277.4) internal successors, (1387), 5 states have internal predecessors, (1387), 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-08-25 06:24:40,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 806.0) internal successors, (4836), 6 states have internal predecessors, (4836), 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-08-25 06:24:40,771 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 806.0) internal successors, (4836), 6 states have internal predecessors, (4836), 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-08-25 06:24:40,771 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 137 flow. Second operand 5 states and 1387 transitions. [2023-08-25 06:24:40,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 63 transitions, 256 flow [2023-08-25 06:24:40,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 63 transitions, 247 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 06:24:40,773 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 146 flow [2023-08-25 06:24:40,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2023-08-25 06:24:40,773 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -60 predicate places. [2023-08-25 06:24:40,773 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 146 flow [2023-08-25 06:24:40,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 270.4) internal successors, (1352), 5 states have internal predecessors, (1352), 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-08-25 06:24:40,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:24:40,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 06:24:40,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 06:24:40,774 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 06:24:40,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:24:40,775 INFO L85 PathProgramCache]: Analyzing trace with hash -322824960, now seen corresponding path program 1 times [2023-08-25 06:24:40,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:24:40,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597579991] [2023-08-25 06:24:40,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:24:40,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:24:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:24:40,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 06:24:40,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:24:40,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597579991] [2023-08-25 06:24:40,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597579991] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:24:40,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:24:40,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 06:24:40,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190879155] [2023-08-25 06:24:40,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:24:40,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 06:24:40,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:24:40,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 06:24:40,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 06:24:40,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 806 [2023-08-25 06:24:40,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 277.1666666666667) internal successors, (1663), 6 states have internal predecessors, (1663), 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-08-25 06:24:40,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:24:40,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 806 [2023-08-25 06:24:40,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:24:41,281 INFO L124 PetriNetUnfolderBase]: 940/1525 cut-off events. [2023-08-25 06:24:41,281 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2023-08-25 06:24:41,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3414 conditions, 1525 events. 940/1525 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 6157 event pairs, 238 based on Foata normal form. 0/1357 useless extension candidates. Maximal degree in co-relation 3408. Up to 746 conditions per place. [2023-08-25 06:24:41,287 INFO L140 encePairwiseOnDemand]: 799/806 looper letters, 87 selfloop transitions, 5 changer transitions 0/98 dead transitions. [2023-08-25 06:24:41,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 98 transitions, 438 flow [2023-08-25 06:24:41,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 06:24:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 06:24:41,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1741 transitions. [2023-08-25 06:24:41,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36000827129859386 [2023-08-25 06:24:41,290 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1741 transitions. [2023-08-25 06:24:41,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1741 transitions. [2023-08-25 06:24:41,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:24:41,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1741 transitions. [2023-08-25 06:24:41,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 290.1666666666667) internal successors, (1741), 6 states have internal predecessors, (1741), 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-08-25 06:24:41,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 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-08-25 06:24:41,299 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 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-08-25 06:24:41,299 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 146 flow. Second operand 6 states and 1741 transitions. [2023-08-25 06:24:41,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 98 transitions, 438 flow [2023-08-25 06:24:41,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 98 transitions, 431 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-25 06:24:41,301 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 145 flow [2023-08-25 06:24:41,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2023-08-25 06:24:41,301 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -59 predicate places. [2023-08-25 06:24:41,301 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 145 flow [2023-08-25 06:24:41,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 277.1666666666667) internal successors, (1663), 6 states have internal predecessors, (1663), 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-08-25 06:24:41,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:24:41,303 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] [2023-08-25 06:24:41,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 06:24:41,304 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 06:24:41,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:24:41,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1079415241, now seen corresponding path program 1 times [2023-08-25 06:24:41,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:24:41,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117446469] [2023-08-25 06:24:41,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:24:41,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:24:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:24:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 06:24:41,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:24:41,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117446469] [2023-08-25 06:24:41,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117446469] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 06:24:41,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278445100] [2023-08-25 06:24:41,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:24:41,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 06:24:41,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 06:24:41,411 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-08-25 06:24:41,453 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-08-25 06:24:41,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:24:41,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-25 06:24:41,532 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 06:24:41,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 06:24:41,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 06:24:41,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 06:24:41,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278445100] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-25 06:24:41,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-25 06:24:41,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2023-08-25 06:24:41,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491915753] [2023-08-25 06:24:41,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:24:41,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 06:24:41,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:24:41,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 06:24:41,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-25 06:24:41,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 806 [2023-08-25 06:24:41,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 270.2) internal successors, (1351), 5 states have internal predecessors, (1351), 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-08-25 06:24:41,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:24:41,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 806 [2023-08-25 06:24:41,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:24:41,832 INFO L124 PetriNetUnfolderBase]: 536/1017 cut-off events. [2023-08-25 06:24:41,832 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2023-08-25 06:24:41,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2273 conditions, 1017 events. 536/1017 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3910 event pairs, 198 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 2267. Up to 423 conditions per place. [2023-08-25 06:24:41,837 INFO L140 encePairwiseOnDemand]: 800/806 looper letters, 66 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2023-08-25 06:24:41,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 379 flow [2023-08-25 06:24:41,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 06:24:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 06:24:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1678 transitions. [2023-08-25 06:24:41,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3469809760132341 [2023-08-25 06:24:41,841 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1678 transitions. [2023-08-25 06:24:41,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1678 transitions. [2023-08-25 06:24:41,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:24:41,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1678 transitions. [2023-08-25 06:24:41,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 279.6666666666667) internal successors, (1678), 6 states have internal predecessors, (1678), 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-08-25 06:24:41,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 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-08-25 06:24:41,851 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 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-08-25 06:24:41,851 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 145 flow. Second operand 6 states and 1678 transitions. [2023-08-25 06:24:41,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 379 flow [2023-08-25 06:24:41,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 359 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-25 06:24:41,857 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 163 flow [2023-08-25 06:24:41,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2023-08-25 06:24:41,858 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -57 predicate places. [2023-08-25 06:24:41,858 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 163 flow [2023-08-25 06:24:41,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 270.2) internal successors, (1351), 5 states have internal predecessors, (1351), 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-08-25 06:24:41,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:24:41,858 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-08-25 06:24:41,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-25 06:24:42,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 06:24:42,063 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 06:24:42,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:24:42,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1896999279, now seen corresponding path program 1 times [2023-08-25 06:24:42,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:24:42,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5213620] [2023-08-25 06:24:42,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:24:42,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:24:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:24:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-25 06:24:42,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:24:42,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5213620] [2023-08-25 06:24:42,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5213620] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:24:42,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:24:42,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 06:24:42,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855287477] [2023-08-25 06:24:42,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:24:42,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 06:24:42,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:24:42,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 06:24:42,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 06:24:42,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 806 [2023-08-25 06:24:42,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 281.5) internal successors, (1689), 6 states have internal predecessors, (1689), 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-08-25 06:24:42,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:24:42,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 806 [2023-08-25 06:24:42,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:24:42,671 INFO L124 PetriNetUnfolderBase]: 1560/2705 cut-off events. [2023-08-25 06:24:42,671 INFO L125 PetriNetUnfolderBase]: For 621/621 co-relation queries the response was YES. [2023-08-25 06:24:42,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6015 conditions, 2705 events. 1560/2705 cut-off events. For 621/621 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 12478 event pairs, 1248 based on Foata normal form. 0/2437 useless extension candidates. Maximal degree in co-relation 6008. Up to 2384 conditions per place. [2023-08-25 06:24:42,681 INFO L140 encePairwiseOnDemand]: 801/806 looper letters, 59 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2023-08-25 06:24:42,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 71 transitions, 335 flow [2023-08-25 06:24:42,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 06:24:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 06:24:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1721 transitions. [2023-08-25 06:24:42,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35587262200165426 [2023-08-25 06:24:42,685 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1721 transitions. [2023-08-25 06:24:42,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1721 transitions. [2023-08-25 06:24:42,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:24:42,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1721 transitions. [2023-08-25 06:24:42,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 286.8333333333333) internal successors, (1721), 6 states have internal predecessors, (1721), 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-08-25 06:24:42,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 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-08-25 06:24:42,694 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 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-08-25 06:24:42,694 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 163 flow. Second operand 6 states and 1721 transitions. [2023-08-25 06:24:42,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 71 transitions, 335 flow [2023-08-25 06:24:42,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 71 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 06:24:42,696 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 165 flow [2023-08-25 06:24:42,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2023-08-25 06:24:42,696 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -55 predicate places. [2023-08-25 06:24:42,696 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 165 flow [2023-08-25 06:24:42,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 281.5) internal successors, (1689), 6 states have internal predecessors, (1689), 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-08-25 06:24:42,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:24:42,697 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-08-25 06:24:42,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 06:24:42,697 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 06:24:42,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:24:42,698 INFO L85 PathProgramCache]: Analyzing trace with hash -815923960, now seen corresponding path program 1 times [2023-08-25 06:24:42,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:24:42,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518659877] [2023-08-25 06:24:42,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:24:42,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:24:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:24:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 06:24:42,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:24:42,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518659877] [2023-08-25 06:24:42,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518659877] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:24:42,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:24:42,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 06:24:42,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189487117] [2023-08-25 06:24:42,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:24:42,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 06:24:42,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:24:42,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 06:24:42,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 06:24:42,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 806 [2023-08-25 06:24:42,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 165 flow. Second operand has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 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-08-25 06:24:42,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:24:42,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 806 [2023-08-25 06:24:42,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:24:43,113 INFO L124 PetriNetUnfolderBase]: 760/1384 cut-off events. [2023-08-25 06:24:43,113 INFO L125 PetriNetUnfolderBase]: For 284/284 co-relation queries the response was YES. [2023-08-25 06:24:43,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3113 conditions, 1384 events. 760/1384 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5937 event pairs, 46 based on Foata normal form. 0/1265 useless extension candidates. Maximal degree in co-relation 3105. Up to 660 conditions per place. [2023-08-25 06:24:43,118 INFO L140 encePairwiseOnDemand]: 801/806 looper letters, 66 selfloop transitions, 11 changer transitions 0/91 dead transitions. [2023-08-25 06:24:43,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 91 transitions, 422 flow [2023-08-25 06:24:43,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 06:24:43,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 06:24:43,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1582 transitions. [2023-08-25 06:24:43,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3925558312655087 [2023-08-25 06:24:43,121 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1582 transitions. [2023-08-25 06:24:43,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1582 transitions. [2023-08-25 06:24:43,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:24:43,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1582 transitions. [2023-08-25 06:24:43,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 316.4) internal successors, (1582), 5 states have internal predecessors, (1582), 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-08-25 06:24:43,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 806.0) internal successors, (4836), 6 states have internal predecessors, (4836), 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-08-25 06:24:43,133 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 806.0) internal successors, (4836), 6 states have internal predecessors, (4836), 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-08-25 06:24:43,133 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 165 flow. Second operand 5 states and 1582 transitions. [2023-08-25 06:24:43,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 91 transitions, 422 flow [2023-08-25 06:24:43,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 413 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 06:24:43,135 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 244 flow [2023-08-25 06:24:43,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2023-08-25 06:24:43,136 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -52 predicate places. [2023-08-25 06:24:43,137 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 244 flow [2023-08-25 06:24:43,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 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-08-25 06:24:43,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:24:43,137 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-08-25 06:24:43,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 06:24:43,138 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 06:24:43,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:24:43,138 INFO L85 PathProgramCache]: Analyzing trace with hash -635856298, now seen corresponding path program 2 times [2023-08-25 06:24:43,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:24:43,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412239662] [2023-08-25 06:24:43,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:24:43,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:24:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:24:43,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-25 06:24:43,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:24:43,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412239662] [2023-08-25 06:24:43,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412239662] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:24:43,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:24:43,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 06:24:43,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449570428] [2023-08-25 06:24:43,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:24:43,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 06:24:43,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:24:43,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 06:24:43,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 06:24:43,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 806 [2023-08-25 06:24:43,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 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-08-25 06:24:43,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:24:43,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 806 [2023-08-25 06:24:43,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:24:43,379 INFO L124 PetriNetUnfolderBase]: 523/1243 cut-off events. [2023-08-25 06:24:43,379 INFO L125 PetriNetUnfolderBase]: For 1028/1035 co-relation queries the response was YES. [2023-08-25 06:24:43,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2931 conditions, 1243 events. 523/1243 cut-off events. For 1028/1035 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6912 event pairs, 176 based on Foata normal form. 2/1185 useless extension candidates. Maximal degree in co-relation 2920. Up to 505 conditions per place. [2023-08-25 06:24:43,385 INFO L140 encePairwiseOnDemand]: 803/806 looper letters, 55 selfloop transitions, 2 changer transitions 1/82 dead transitions. [2023-08-25 06:24:43,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 82 transitions, 463 flow [2023-08-25 06:24:43,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 06:24:43,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 06:24:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1002 transitions. [2023-08-25 06:24:43,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4143920595533499 [2023-08-25 06:24:43,387 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1002 transitions. [2023-08-25 06:24:43,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1002 transitions. [2023-08-25 06:24:43,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:24:43,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1002 transitions. [2023-08-25 06:24:43,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-08-25 06:24:43,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 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-08-25 06:24:43,392 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 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-08-25 06:24:43,392 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 244 flow. Second operand 3 states and 1002 transitions. [2023-08-25 06:24:43,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 82 transitions, 463 flow [2023-08-25 06:24:43,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 82 transitions, 459 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-25 06:24:43,394 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 252 flow [2023-08-25 06:24:43,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2023-08-25 06:24:43,395 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -49 predicate places. [2023-08-25 06:24:43,395 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 252 flow [2023-08-25 06:24:43,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 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-08-25 06:24:43,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:24:43,395 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-08-25 06:24:43,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 06:24:43,395 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 06:24:43,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:24:43,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1520055367, now seen corresponding path program 1 times [2023-08-25 06:24:43,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:24:43,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038162419] [2023-08-25 06:24:43,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:24:43,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:24:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:24:43,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-25 06:24:43,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:24:43,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038162419] [2023-08-25 06:24:43,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038162419] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:24:43,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:24:43,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 06:24:43,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633019366] [2023-08-25 06:24:43,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:24:43,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 06:24:43,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:24:43,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 06:24:43,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 06:24:43,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 806 [2023-08-25 06:24:43,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 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-08-25 06:24:43,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:24:43,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 806 [2023-08-25 06:24:43,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:24:43,628 INFO L124 PetriNetUnfolderBase]: 507/1376 cut-off events. [2023-08-25 06:24:43,628 INFO L125 PetriNetUnfolderBase]: For 1277/1285 co-relation queries the response was YES. [2023-08-25 06:24:43,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3312 conditions, 1376 events. 507/1376 cut-off events. For 1277/1285 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7935 event pairs, 184 based on Foata normal form. 52/1360 useless extension candidates. Maximal degree in co-relation 3299. Up to 616 conditions per place. [2023-08-25 06:24:43,651 INFO L140 encePairwiseOnDemand]: 803/806 looper letters, 54 selfloop transitions, 2 changer transitions 4/84 dead transitions. [2023-08-25 06:24:43,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 84 transitions, 483 flow [2023-08-25 06:24:43,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 06:24:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 06:24:43,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1005 transitions. [2023-08-25 06:24:43,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41563275434243174 [2023-08-25 06:24:43,654 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1005 transitions. [2023-08-25 06:24:43,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1005 transitions. [2023-08-25 06:24:43,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:24:43,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1005 transitions. [2023-08-25 06:24:43,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 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-08-25 06:24:43,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 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-08-25 06:24:43,659 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 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-08-25 06:24:43,659 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 252 flow. Second operand 3 states and 1005 transitions. [2023-08-25 06:24:43,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 84 transitions, 483 flow [2023-08-25 06:24:43,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 84 transitions, 481 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 06:24:43,661 INFO L231 Difference]: Finished difference. Result has 73 places, 64 transitions, 262 flow [2023-08-25 06:24:43,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=73, PETRI_TRANSITIONS=64} [2023-08-25 06:24:43,662 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -47 predicate places. [2023-08-25 06:24:43,662 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 262 flow [2023-08-25 06:24:43,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 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-08-25 06:24:43,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:24:43,662 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1] [2023-08-25 06:24:43,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-25 06:24:43,663 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 06:24:43,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:24:43,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1734987576, now seen corresponding path program 1 times [2023-08-25 06:24:43,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:24:43,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513328666] [2023-08-25 06:24:43,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:24:43,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:24:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:24:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 06:24:43,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:24:43,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513328666] [2023-08-25 06:24:43,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513328666] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:24:43,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:24:43,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 06:24:43,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611013016] [2023-08-25 06:24:43,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:24:43,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 06:24:43,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:24:43,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 06:24:43,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 06:24:43,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 806 [2023-08-25 06:24:43,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 64 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 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-08-25 06:24:43,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:24:43,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 806 [2023-08-25 06:24:43,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:24:43,979 INFO L124 PetriNetUnfolderBase]: 638/1719 cut-off events. [2023-08-25 06:24:43,979 INFO L125 PetriNetUnfolderBase]: For 1672/1684 co-relation queries the response was YES. [2023-08-25 06:24:43,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4288 conditions, 1719 events. 638/1719 cut-off events. For 1672/1684 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10471 event pairs, 481 based on Foata normal form. 20/1628 useless extension candidates. Maximal degree in co-relation 4274. Up to 876 conditions per place. [2023-08-25 06:24:43,986 INFO L140 encePairwiseOnDemand]: 801/806 looper letters, 39 selfloop transitions, 2 changer transitions 26/91 dead transitions. [2023-08-25 06:24:43,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 91 transitions, 534 flow [2023-08-25 06:24:43,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 06:24:43,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 06:24:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1477 transitions. [2023-08-25 06:24:43,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36650124069478907 [2023-08-25 06:24:43,990 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1477 transitions. [2023-08-25 06:24:43,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1477 transitions. [2023-08-25 06:24:43,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:24:43,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1477 transitions. [2023-08-25 06:24:43,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 295.4) internal successors, (1477), 5 states have internal predecessors, (1477), 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-08-25 06:24:43,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 806.0) internal successors, (4836), 6 states have internal predecessors, (4836), 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-08-25 06:24:43,996 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 806.0) internal successors, (4836), 6 states have internal predecessors, (4836), 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-08-25 06:24:43,996 INFO L175 Difference]: Start difference. First operand has 73 places, 64 transitions, 262 flow. Second operand 5 states and 1477 transitions. [2023-08-25 06:24:43,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 91 transitions, 534 flow [2023-08-25 06:24:43,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 91 transitions, 532 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 06:24:44,000 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 276 flow [2023-08-25 06:24:44,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2023-08-25 06:24:44,002 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -41 predicate places. [2023-08-25 06:24:44,002 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 276 flow [2023-08-25 06:24:44,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 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-08-25 06:24:44,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:24:44,002 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1] [2023-08-25 06:24:44,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-25 06:24:44,002 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 06:24:44,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:24:44,003 INFO L85 PathProgramCache]: Analyzing trace with hash -533027293, now seen corresponding path program 1 times [2023-08-25 06:24:44,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:24:44,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255017069] [2023-08-25 06:24:44,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:24:44,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:24:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:24:45,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 06:24:45,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:24:45,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255017069] [2023-08-25 06:24:45,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255017069] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 06:24:45,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396815508] [2023-08-25 06:24:45,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:24:45,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 06:24:45,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 06:24:45,015 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-08-25 06:24:45,017 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-08-25 06:24:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:24:45,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 51 conjunts are in the unsatisfiable core [2023-08-25 06:24:45,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 06:24:45,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 06:24:45,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 06:24:45,231 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-25 06:24:45,232 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-25 06:24:45,269 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-25 06:24:45,307 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-25 06:24:45,308 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-25 06:24:45,339 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 06:24:45,363 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 06:24:45,471 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 06:24:46,036 INFO L322 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-08-25 06:24:46,036 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 22 [2023-08-25 06:24:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 06:24:46,061 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 06:24:46,261 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:24:46,262 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 224 [2023-08-25 06:24:47,557 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:24:47,558 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 90 [2023-08-25 06:24:47,581 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-25 06:24:47,582 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13676 treesize of output 13167 [2023-08-25 06:24:47,696 INFO L322 Elim1Store]: treesize reduction 8, result has 80.5 percent of original size [2023-08-25 06:24:47,697 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1628 treesize of output 1276 [2023-08-25 06:24:47,721 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 06:24:47,733 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:24:47,733 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1244 treesize of output 1132 [2023-08-25 06:24:47,780 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 06:24:47,791 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:24:47,791 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1100 treesize of output 940 [2023-08-25 06:24:49,016 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:24:49,016 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 51 [2023-08-25 06:24:49,020 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3350 treesize of output 3222 [2023-08-25 06:24:49,043 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:24:49,044 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 798 treesize of output 743 [2023-08-25 06:24:49,061 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:24:49,061 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 726 treesize of output 551 [2023-08-25 06:24:49,079 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:24:49,079 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 534 treesize of output 455 [2023-08-25 06:24:49,413 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 06:24:49,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396815508] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 06:24:49,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 06:24:49,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 27 [2023-08-25 06:24:49,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117653312] [2023-08-25 06:24:49,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 06:24:49,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-25 06:24:49,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:24:49,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-25 06:24:49,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=613, Unknown=8, NotChecked=0, Total=812 [2023-08-25 06:24:49,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 806 [2023-08-25 06:24:49,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 65 transitions, 276 flow. Second operand has 29 states, 29 states have (on average 203.44827586206895) internal successors, (5900), 29 states have internal predecessors, (5900), 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-08-25 06:24:49,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:24:49,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 806 [2023-08-25 06:24:49,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:25:09,536 INFO L124 PetriNetUnfolderBase]: 16106/27050 cut-off events. [2023-08-25 06:25:09,537 INFO L125 PetriNetUnfolderBase]: For 28614/28686 co-relation queries the response was YES. [2023-08-25 06:25:09,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76633 conditions, 27050 events. 16106/27050 cut-off events. For 28614/28686 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 186270 event pairs, 1520 based on Foata normal form. 4/26487 useless extension candidates. Maximal degree in co-relation 76616. Up to 4522 conditions per place. [2023-08-25 06:25:09,679 INFO L140 encePairwiseOnDemand]: 790/806 looper letters, 745 selfloop transitions, 92 changer transitions 65/908 dead transitions. [2023-08-25 06:25:09,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 908 transitions, 5120 flow [2023-08-25 06:25:09,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-25 06:25:09,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-08-25 06:25:09,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 8557 transitions. [2023-08-25 06:25:09,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2722211617993256 [2023-08-25 06:25:09,696 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 8557 transitions. [2023-08-25 06:25:09,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 8557 transitions. [2023-08-25 06:25:09,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:25:09,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 8557 transitions. [2023-08-25 06:25:09,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 219.4102564102564) internal successors, (8557), 39 states have internal predecessors, (8557), 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-08-25 06:25:09,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 806.0) internal successors, (32240), 40 states have internal predecessors, (32240), 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-08-25 06:25:09,739 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 806.0) internal successors, (32240), 40 states have internal predecessors, (32240), 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-08-25 06:25:09,739 INFO L175 Difference]: Start difference. First operand has 79 places, 65 transitions, 276 flow. Second operand 39 states and 8557 transitions. [2023-08-25 06:25:09,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 908 transitions, 5120 flow [2023-08-25 06:25:09,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 908 transitions, 5094 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-25 06:25:09,781 INFO L231 Difference]: Finished difference. Result has 134 places, 174 transitions, 1207 flow [2023-08-25 06:25:09,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=1207, PETRI_PLACES=134, PETRI_TRANSITIONS=174} [2023-08-25 06:25:09,781 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 14 predicate places. [2023-08-25 06:25:09,782 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 174 transitions, 1207 flow [2023-08-25 06:25:09,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 203.44827586206895) internal successors, (5900), 29 states have internal predecessors, (5900), 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-08-25 06:25:09,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:25:09,783 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, 1, 1, 1, 1] [2023-08-25 06:25:09,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-25 06:25:09,988 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,SelfDestructingSolverStorable12 [2023-08-25 06:25:09,989 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 06:25:09,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:25:09,989 INFO L85 PathProgramCache]: Analyzing trace with hash 942924050, now seen corresponding path program 2 times [2023-08-25 06:25:09,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:25:09,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127737145] [2023-08-25 06:25:09,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:25:09,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:25:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:25:12,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 06:25:12,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:25:12,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127737145] [2023-08-25 06:25:12,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127737145] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 06:25:12,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473802507] [2023-08-25 06:25:12,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 06:25:12,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 06:25:12,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 06:25:12,243 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-08-25 06:25:12,245 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-08-25 06:25:12,433 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 06:25:12,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 06:25:12,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 63 conjunts are in the unsatisfiable core [2023-08-25 06:25:12,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 06:25:12,472 INFO L322 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-08-25 06:25:12,472 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 27 [2023-08-25 06:25:12,570 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-25 06:25:12,570 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-25 06:25:12,610 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 06:25:12,649 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-25 06:25:12,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 06:25:12,823 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-25 06:25:13,205 INFO L322 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-08-25 06:25:13,206 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 19 [2023-08-25 06:25:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 06:25:13,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 06:25:25,822 WARN L234 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 06:25:26,247 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:25:26,247 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 74 [2023-08-25 06:25:26,256 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:25:26,256 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 979 treesize of output 951 [2023-08-25 06:25:26,297 INFO L322 Elim1Store]: treesize reduction 24, result has 65.2 percent of original size [2023-08-25 06:25:26,297 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 667 treesize of output 672 [2023-08-25 06:25:26,331 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:25:26,332 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 569 treesize of output 543 [2023-08-25 06:25:26,361 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:25:26,361 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 586 treesize of output 494 [2023-08-25 06:25:29,772 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-25 06:25:29,773 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2023-08-25 06:25:29,784 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:25:29,785 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2023-08-25 06:25:29,791 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:25:29,791 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2023-08-25 06:25:29,805 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-08-25 06:25:29,808 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-08-25 06:25:29,818 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-25 06:25:29,818 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 1 [2023-08-25 06:25:29,823 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-25 06:25:29,873 INFO L322 Elim1Store]: treesize reduction 21, result has 71.2 percent of original size [2023-08-25 06:25:29,874 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 30 treesize of output 61 [2023-08-25 06:25:29,905 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-25 06:25:29,927 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-25 06:25:29,930 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-25 06:25:29,937 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:25:29,937 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 45 [2023-08-25 06:25:29,939 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 06:25:29,939 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 06:25:29,944 INFO L322 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-08-25 06:25:29,944 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 138 [2023-08-25 06:25:29,948 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2023-08-25 06:25:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 06:25:30,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473802507] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 06:25:30,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 06:25:30,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 27 [2023-08-25 06:25:30,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289702195] [2023-08-25 06:25:30,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 06:25:30,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-25 06:25:30,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:25:30,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-25 06:25:30,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=658, Unknown=8, NotChecked=0, Total=812 [2023-08-25 06:25:30,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 806 [2023-08-25 06:25:30,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 174 transitions, 1207 flow. Second operand has 29 states, 29 states have (on average 205.51724137931035) internal successors, (5960), 29 states have internal predecessors, (5960), 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-08-25 06:25:30,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:25:30,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 806 [2023-08-25 06:25:30,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:25:37,693 INFO L124 PetriNetUnfolderBase]: 25735/43307 cut-off events. [2023-08-25 06:25:37,693 INFO L125 PetriNetUnfolderBase]: For 108289/108409 co-relation queries the response was YES. [2023-08-25 06:25:37,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150115 conditions, 43307 events. 25735/43307 cut-off events. For 108289/108409 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 315554 event pairs, 3455 based on Foata normal form. 2/43212 useless extension candidates. Maximal degree in co-relation 150078. Up to 13782 conditions per place. [2023-08-25 06:25:37,997 INFO L140 encePairwiseOnDemand]: 792/806 looper letters, 414 selfloop transitions, 98 changer transitions 53/571 dead transitions. [2023-08-25 06:25:37,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 571 transitions, 4431 flow [2023-08-25 06:25:37,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-25 06:25:37,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-25 06:25:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4556 transitions. [2023-08-25 06:25:38,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26917168852652723 [2023-08-25 06:25:38,002 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4556 transitions. [2023-08-25 06:25:38,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4556 transitions. [2023-08-25 06:25:38,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:25:38,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4556 transitions. [2023-08-25 06:25:38,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 216.95238095238096) internal successors, (4556), 21 states have internal predecessors, (4556), 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-08-25 06:25:38,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 806.0) internal successors, (17732), 22 states have internal predecessors, (17732), 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-08-25 06:25:38,020 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 806.0) internal successors, (17732), 22 states have internal predecessors, (17732), 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-08-25 06:25:38,020 INFO L175 Difference]: Start difference. First operand has 134 places, 174 transitions, 1207 flow. Second operand 21 states and 4556 transitions. [2023-08-25 06:25:38,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 571 transitions, 4431 flow [2023-08-25 06:25:39,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 571 transitions, 4208 flow, removed 77 selfloop flow, removed 4 redundant places. [2023-08-25 06:25:39,197 INFO L231 Difference]: Finished difference. Result has 160 places, 239 transitions, 1981 flow [2023-08-25 06:25:39,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1981, PETRI_PLACES=160, PETRI_TRANSITIONS=239} [2023-08-25 06:25:39,197 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 40 predicate places. [2023-08-25 06:25:39,197 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 239 transitions, 1981 flow [2023-08-25 06:25:39,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 205.51724137931035) internal successors, (5960), 29 states have internal predecessors, (5960), 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-08-25 06:25:39,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:25:39,199 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, 1, 1, 1, 1] [2023-08-25 06:25:39,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-25 06:25:39,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 06:25:39,404 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 06:25:39,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:25:39,405 INFO L85 PathProgramCache]: Analyzing trace with hash 868638532, now seen corresponding path program 3 times [2023-08-25 06:25:39,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:25:39,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305509319] [2023-08-25 06:25:39,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:25:39,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:25:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:25:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 06:25:40,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:25:40,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305509319] [2023-08-25 06:25:40,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305509319] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 06:25:40,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396088288] [2023-08-25 06:25:40,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 06:25:40,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 06:25:40,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 06:25:40,788 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-08-25 06:25:40,788 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-08-25 06:25:40,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-25 06:25:40,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 06:25:40,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-25 06:25:40,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 06:25:41,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 06:25:41,358 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-25 06:25:41,358 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2023-08-25 06:25:41,364 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-08-25 06:25:41,668 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 06:25:41,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 06:25:41,821 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:25:41,821 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 224 [2023-08-25 06:25:42,446 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:25:42,447 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 137 [2023-08-25 06:25:42,454 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2023-08-25 06:25:42,932 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 06:25:42,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396088288] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 06:25:42,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 06:25:42,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 9] total 30 [2023-08-25 06:25:42,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442637110] [2023-08-25 06:25:42,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 06:25:42,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-25 06:25:42,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:25:42,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-25 06:25:42,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2023-08-25 06:25:42,936 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 806 [2023-08-25 06:25:42,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 239 transitions, 1981 flow. Second operand has 32 states, 32 states have (on average 206.09375) internal successors, (6595), 32 states have internal predecessors, (6595), 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-08-25 06:25:42,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:25:42,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 806 [2023-08-25 06:25:42,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:25:53,666 INFO L124 PetriNetUnfolderBase]: 38830/64776 cut-off events. [2023-08-25 06:25:53,667 INFO L125 PetriNetUnfolderBase]: For 249966/250297 co-relation queries the response was YES. [2023-08-25 06:25:54,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244700 conditions, 64776 events. 38830/64776 cut-off events. For 249966/250297 co-relation queries the response was YES. Maximal size of possible extension queue 995. Compared 499202 event pairs, 4595 based on Foata normal form. 16/64542 useless extension candidates. Maximal degree in co-relation 244656. Up to 18478 conditions per place. [2023-08-25 06:25:54,330 INFO L140 encePairwiseOnDemand]: 790/806 looper letters, 488 selfloop transitions, 166 changer transitions 52/712 dead transitions. [2023-08-25 06:25:54,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 712 transitions, 6281 flow [2023-08-25 06:25:54,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-25 06:25:54,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-25 06:25:54,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 6053 transitions. [2023-08-25 06:25:54,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26821162708259483 [2023-08-25 06:25:54,340 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 6053 transitions. [2023-08-25 06:25:54,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 6053 transitions. [2023-08-25 06:25:54,342 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:25:54,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 6053 transitions. [2023-08-25 06:25:54,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 216.17857142857142) internal successors, (6053), 28 states have internal predecessors, (6053), 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-08-25 06:25:54,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 806.0) internal successors, (23374), 29 states have internal predecessors, (23374), 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-08-25 06:25:54,382 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 806.0) internal successors, (23374), 29 states have internal predecessors, (23374), 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-08-25 06:25:54,382 INFO L175 Difference]: Start difference. First operand has 160 places, 239 transitions, 1981 flow. Second operand 28 states and 6053 transitions. [2023-08-25 06:25:54,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 712 transitions, 6281 flow [2023-08-25 06:25:58,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 712 transitions, 6159 flow, removed 54 selfloop flow, removed 6 redundant places. [2023-08-25 06:25:58,116 INFO L231 Difference]: Finished difference. Result has 194 places, 331 transitions, 3515 flow [2023-08-25 06:25:58,117 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=1933, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=3515, PETRI_PLACES=194, PETRI_TRANSITIONS=331} [2023-08-25 06:25:58,117 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 74 predicate places. [2023-08-25 06:25:58,117 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 331 transitions, 3515 flow [2023-08-25 06:25:58,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 206.09375) internal successors, (6595), 32 states have internal predecessors, (6595), 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-08-25 06:25:58,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:25:58,118 INFO L208 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1] [2023-08-25 06:25:58,127 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-08-25 06:25:58,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-25 06:25:58,323 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 06:25:58,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:25:58,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1097406076, now seen corresponding path program 4 times [2023-08-25 06:25:58,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:25:58,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348431846] [2023-08-25 06:25:58,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:25:58,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:25:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:25:58,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-25 06:25:58,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:25:58,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348431846] [2023-08-25 06:25:58,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348431846] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:25:58,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:25:58,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 06:25:58,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921847561] [2023-08-25 06:25:58,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:25:58,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 06:25:58,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:25:58,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 06:25:58,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-25 06:25:58,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 806 [2023-08-25 06:25:58,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 331 transitions, 3515 flow. Second operand has 4 states, 4 states have (on average 327.75) internal successors, (1311), 4 states have internal predecessors, (1311), 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-08-25 06:25:58,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:25:58,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 806 [2023-08-25 06:25:58,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:26:02,149 INFO L124 PetriNetUnfolderBase]: 9709/25508 cut-off events. [2023-08-25 06:26:02,149 INFO L125 PetriNetUnfolderBase]: For 145943/146466 co-relation queries the response was YES. [2023-08-25 06:26:02,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98266 conditions, 25508 events. 9709/25508 cut-off events. For 145943/146466 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 254574 event pairs, 2660 based on Foata normal form. 486/25293 useless extension candidates. Maximal degree in co-relation 98208. Up to 7124 conditions per place. [2023-08-25 06:26:02,341 INFO L140 encePairwiseOnDemand]: 803/806 looper letters, 389 selfloop transitions, 81 changer transitions 55/557 dead transitions. [2023-08-25 06:26:02,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 557 transitions, 6993 flow [2023-08-25 06:26:02,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 06:26:02,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 06:26:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1350 transitions. [2023-08-25 06:26:02,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41873449131513646 [2023-08-25 06:26:02,343 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1350 transitions. [2023-08-25 06:26:02,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1350 transitions. [2023-08-25 06:26:02,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:26:02,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1350 transitions. [2023-08-25 06:26:02,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 337.5) internal successors, (1350), 4 states have internal predecessors, (1350), 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-08-25 06:26:02,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 806.0) internal successors, (4030), 5 states have internal predecessors, (4030), 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-08-25 06:26:02,347 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 806.0) internal successors, (4030), 5 states have internal predecessors, (4030), 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-08-25 06:26:02,347 INFO L175 Difference]: Start difference. First operand has 194 places, 331 transitions, 3515 flow. Second operand 4 states and 1350 transitions. [2023-08-25 06:26:02,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 557 transitions, 6993 flow [2023-08-25 06:26:03,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 557 transitions, 6845 flow, removed 44 selfloop flow, removed 9 redundant places. [2023-08-25 06:26:03,064 INFO L231 Difference]: Finished difference. Result has 190 places, 377 transitions, 4353 flow [2023-08-25 06:26:03,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=3397, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4353, PETRI_PLACES=190, PETRI_TRANSITIONS=377} [2023-08-25 06:26:03,064 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 70 predicate places. [2023-08-25 06:26:03,064 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 377 transitions, 4353 flow [2023-08-25 06:26:03,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 327.75) internal successors, (1311), 4 states have internal predecessors, (1311), 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-08-25 06:26:03,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:26:03,065 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 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-08-25 06:26:03,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-25 06:26:03,065 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 06:26:03,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:26:03,065 INFO L85 PathProgramCache]: Analyzing trace with hash 952197668, now seen corresponding path program 1 times [2023-08-25 06:26:03,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:26:03,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577671178] [2023-08-25 06:26:03,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:26:03,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:26:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:26:03,203 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-25 06:26:03,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:26:03,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577671178] [2023-08-25 06:26:03,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577671178] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 06:26:03,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122875843] [2023-08-25 06:26:03,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:26:03,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 06:26:03,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 06:26:03,205 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 06:26:03,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-25 06:26:03,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:26:03,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-25 06:26:03,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 06:26:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-25 06:26:03,486 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 06:26:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-25 06:26:03,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122875843] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 06:26:03,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 06:26:03,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-25 06:26:03,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154773085] [2023-08-25 06:26:03,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 06:26:03,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-25 06:26:03,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:26:03,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-25 06:26:03,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-08-25 06:26:03,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 806 [2023-08-25 06:26:03,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 377 transitions, 4353 flow. Second operand has 13 states, 13 states have (on average 272.6923076923077) internal successors, (3545), 13 states have internal predecessors, (3545), 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-08-25 06:26:03,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:26:03,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 806 [2023-08-25 06:26:03,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:26:09,672 INFO L124 PetriNetUnfolderBase]: 17449/34737 cut-off events. [2023-08-25 06:26:09,672 INFO L125 PetriNetUnfolderBase]: For 240162/240713 co-relation queries the response was YES. [2023-08-25 06:26:09,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152329 conditions, 34737 events. 17449/34737 cut-off events. For 240162/240713 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 288054 event pairs, 10961 based on Foata normal form. 194/34679 useless extension candidates. Maximal degree in co-relation 152268. Up to 24350 conditions per place. [2023-08-25 06:26:09,953 INFO L140 encePairwiseOnDemand]: 799/806 looper letters, 343 selfloop transitions, 20 changer transitions 190/567 dead transitions. [2023-08-25 06:26:09,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 567 transitions, 7631 flow [2023-08-25 06:26:09,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-25 06:26:09,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-25 06:26:09,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2228 transitions. [2023-08-25 06:26:09,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3455334987593052 [2023-08-25 06:26:09,955 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2228 transitions. [2023-08-25 06:26:09,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2228 transitions. [2023-08-25 06:26:09,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:26:09,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2228 transitions. [2023-08-25 06:26:09,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 278.5) internal successors, (2228), 8 states have internal predecessors, (2228), 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-08-25 06:26:09,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 806.0) internal successors, (7254), 9 states have internal predecessors, (7254), 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-08-25 06:26:09,961 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 806.0) internal successors, (7254), 9 states have internal predecessors, (7254), 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-08-25 06:26:09,961 INFO L175 Difference]: Start difference. First operand has 190 places, 377 transitions, 4353 flow. Second operand 8 states and 2228 transitions. [2023-08-25 06:26:09,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 567 transitions, 7631 flow [2023-08-25 06:26:12,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 567 transitions, 7489 flow, removed 29 selfloop flow, removed 1 redundant places. [2023-08-25 06:26:12,370 INFO L231 Difference]: Finished difference. Result has 199 places, 336 transitions, 3811 flow [2023-08-25 06:26:12,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=3940, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3811, PETRI_PLACES=199, PETRI_TRANSITIONS=336} [2023-08-25 06:26:12,370 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 79 predicate places. [2023-08-25 06:26:12,370 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 336 transitions, 3811 flow [2023-08-25 06:26:12,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 272.6923076923077) internal successors, (3545), 13 states have internal predecessors, (3545), 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-08-25 06:26:12,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:26:12,371 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2023-08-25 06:26:12,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-25 06:26:12,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-25 06:26:12,572 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 06:26:12,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:26:12,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1695524578, now seen corresponding path program 2 times [2023-08-25 06:26:12,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:26:12,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194920375] [2023-08-25 06:26:12,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:26:12,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:26:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:26:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-25 06:26:12,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:26:12,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194920375] [2023-08-25 06:26:12,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194920375] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:26:12,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:26:12,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 06:26:12,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335670815] [2023-08-25 06:26:12,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:26:12,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 06:26:12,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:26:12,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 06:26:12,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-25 06:26:12,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 806 [2023-08-25 06:26:12,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 336 transitions, 3811 flow. Second operand has 6 states, 6 states have (on average 259.8333333333333) internal successors, (1559), 6 states have internal predecessors, (1559), 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-08-25 06:26:12,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:26:12,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 806 [2023-08-25 06:26:12,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:26:25,360 INFO L124 PetriNetUnfolderBase]: 45538/76991 cut-off events. [2023-08-25 06:26:25,360 INFO L125 PetriNetUnfolderBase]: For 486886/487703 co-relation queries the response was YES. [2023-08-25 06:26:26,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332883 conditions, 76991 events. 45538/76991 cut-off events. For 486886/487703 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 591425 event pairs, 11384 based on Foata normal form. 138/76677 useless extension candidates. Maximal degree in co-relation 332818. Up to 64477 conditions per place. [2023-08-25 06:26:26,490 INFO L140 encePairwiseOnDemand]: 798/806 looper letters, 317 selfloop transitions, 38 changer transitions 4/369 dead transitions. [2023-08-25 06:26:26,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 369 transitions, 4448 flow [2023-08-25 06:26:26,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 06:26:26,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 06:26:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1614 transitions. [2023-08-25 06:26:26,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3337468982630273 [2023-08-25 06:26:26,493 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1614 transitions. [2023-08-25 06:26:26,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1614 transitions. [2023-08-25 06:26:26,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:26:26,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1614 transitions. [2023-08-25 06:26:26,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 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-08-25 06:26:26,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 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-08-25 06:26:26,497 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 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-08-25 06:26:26,497 INFO L175 Difference]: Start difference. First operand has 199 places, 336 transitions, 3811 flow. Second operand 6 states and 1614 transitions. [2023-08-25 06:26:26,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 369 transitions, 4448 flow [2023-08-25 06:26:30,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 369 transitions, 4299 flow, removed 34 selfloop flow, removed 10 redundant places. [2023-08-25 06:26:30,878 INFO L231 Difference]: Finished difference. Result has 190 places, 303 transitions, 3360 flow [2023-08-25 06:26:30,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=3193, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3360, PETRI_PLACES=190, PETRI_TRANSITIONS=303} [2023-08-25 06:26:30,878 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 70 predicate places. [2023-08-25 06:26:30,879 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 303 transitions, 3360 flow [2023-08-25 06:26:30,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 259.8333333333333) internal successors, (1559), 6 states have internal predecessors, (1559), 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-08-25 06:26:30,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:26:30,879 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-08-25 06:26:30,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-25 06:26:30,879 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 06:26:30,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:26:30,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1491383471, now seen corresponding path program 5 times [2023-08-25 06:26:30,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:26:30,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998858427] [2023-08-25 06:26:30,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:26:30,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:26:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:26:31,062 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-25 06:26:31,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:26:31,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998858427] [2023-08-25 06:26:31,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998858427] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 06:26:31,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372448731] [2023-08-25 06:26:31,063 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-25 06:26:31,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 06:26:31,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 06:26:31,065 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 06:26:31,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-25 06:26:44,650 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-25 06:26:44,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 06:26:44,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-25 06:26:44,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 06:26:44,767 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-08-25 06:26:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-25 06:26:44,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 06:26:44,898 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-08-25 06:26:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-25 06:26:44,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372448731] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 06:26:44,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 06:26:44,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 11 [2023-08-25 06:26:44,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644148922] [2023-08-25 06:26:44,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 06:26:44,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-25 06:26:44,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:26:44,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-25 06:26:44,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2023-08-25 06:26:44,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 806 [2023-08-25 06:26:44,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 303 transitions, 3360 flow. Second operand has 12 states, 12 states have (on average 288.4166666666667) internal successors, (3461), 12 states have internal predecessors, (3461), 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-08-25 06:26:44,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:26:44,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 806 [2023-08-25 06:26:44,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:26:46,641 INFO L124 PetriNetUnfolderBase]: 4501/11573 cut-off events. [2023-08-25 06:26:46,641 INFO L125 PetriNetUnfolderBase]: For 66367/66779 co-relation queries the response was YES. [2023-08-25 06:26:46,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47738 conditions, 11573 events. 4501/11573 cut-off events. For 66367/66779 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 99478 event pairs, 2573 based on Foata normal form. 68/11138 useless extension candidates. Maximal degree in co-relation 47676. Up to 6156 conditions per place. [2023-08-25 06:26:46,715 INFO L140 encePairwiseOnDemand]: 801/806 looper letters, 140 selfloop transitions, 3 changer transitions 110/281 dead transitions. [2023-08-25 06:26:46,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 281 transitions, 3626 flow [2023-08-25 06:26:46,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-25 06:26:46,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-25 06:26:46,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2054 transitions. [2023-08-25 06:26:46,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3640552995391705 [2023-08-25 06:26:46,717 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2054 transitions. [2023-08-25 06:26:46,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2054 transitions. [2023-08-25 06:26:46,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:26:46,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2054 transitions. [2023-08-25 06:26:46,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 293.42857142857144) internal successors, (2054), 7 states have internal predecessors, (2054), 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-08-25 06:26:46,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 806.0) internal successors, (6448), 8 states have internal predecessors, (6448), 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-08-25 06:26:46,722 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 806.0) internal successors, (6448), 8 states have internal predecessors, (6448), 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-08-25 06:26:46,722 INFO L175 Difference]: Start difference. First operand has 190 places, 303 transitions, 3360 flow. Second operand 7 states and 2054 transitions. [2023-08-25 06:26:46,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 281 transitions, 3626 flow [2023-08-25 06:26:46,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 281 transitions, 3574 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-08-25 06:26:46,853 INFO L231 Difference]: Finished difference. Result has 183 places, 171 transitions, 1826 flow [2023-08-25 06:26:46,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=2545, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1826, PETRI_PLACES=183, PETRI_TRANSITIONS=171} [2023-08-25 06:26:46,853 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 63 predicate places. [2023-08-25 06:26:46,853 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 171 transitions, 1826 flow [2023-08-25 06:26:46,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 288.4166666666667) internal successors, (3461), 12 states have internal predecessors, (3461), 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-08-25 06:26:46,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:26:46,854 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-08-25 06:26:46,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-25 06:26:47,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 06:26:47,057 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-25 06:26:47,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:26:47,057 INFO L85 PathProgramCache]: Analyzing trace with hash 671756240, now seen corresponding path program 6 times [2023-08-25 06:26:47,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:26:47,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415751824] [2023-08-25 06:26:47,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:26:47,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:26:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:26:49,623 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 06:26:49,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:26:49,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415751824] [2023-08-25 06:26:49,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415751824] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 06:26:49,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317768030] [2023-08-25 06:26:49,624 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-25 06:26:49,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 06:26:49,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 06:26:49,625 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 06:26:49,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-25 06:26:50,164 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-25 06:26:50,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 06:26:50,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 62 conjunts are in the unsatisfiable core [2023-08-25 06:26:50,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 06:26:50,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 06:26:50,398 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-25 06:26:50,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 06:26:50,472 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-25 06:26:52,465 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 06:26:52,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 06:26:52,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 06:26:52,468 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 06:26:52,482 INFO L322 Elim1Store]: treesize reduction 50, result has 19.4 percent of original size [2023-08-25 06:26:52,483 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 85 treesize of output 36 [2023-08-25 06:26:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 06:26:52,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 06:26:53,860 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:26:53,861 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 224 [2023-08-25 06:27:02,813 INFO L322 Elim1Store]: treesize reduction 158, result has 87.4 percent of original size [2023-08-25 06:27:02,814 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 9602 treesize of output 9265 [2023-08-25 06:27:03,779 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:27:03,780 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 44 case distinctions, treesize of input 2583 treesize of output 2797 [2023-08-25 06:27:04,184 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:27:04,185 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 2240 treesize of output 2181 [2023-08-25 06:27:04,647 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:27:04,648 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1998 treesize of output 1899 [2023-08-25 06:27:05,006 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:27:05,006 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1770 treesize of output 1635 Received shutdown request... [2023-08-25 06:38:20,685 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 06:38:20,685 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 06:38:20,694 WARN L266 SmtUtils]: Removed 2 from assertion stack [2023-08-25 06:38:20,695 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONASSERT (119 of 120 remaining) [2023-08-25 06:38:20,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-25 06:38:20,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 06:38:20,896 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. [2023-08-25 06:38:20,897 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (118 of 120 remaining) [2023-08-25 06:38:20,897 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (117 of 120 remaining) [2023-08-25 06:38:20,897 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (116 of 120 remaining) [2023-08-25 06:38:20,897 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (115 of 120 remaining) [2023-08-25 06:38:20,897 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (114 of 120 remaining) [2023-08-25 06:38:20,897 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (113 of 120 remaining) [2023-08-25 06:38:20,897 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (112 of 120 remaining) [2023-08-25 06:38:20,897 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (111 of 120 remaining) [2023-08-25 06:38:20,898 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONDATA_RACE (110 of 120 remaining) [2023-08-25 06:38:20,898 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONDATA_RACE (109 of 120 remaining) [2023-08-25 06:38:20,898 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err10ASSERT_VIOLATIONDATA_RACE (108 of 120 remaining) [2023-08-25 06:38:20,898 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err11ASSERT_VIOLATIONDATA_RACE (107 of 120 remaining) [2023-08-25 06:38:20,898 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err12ASSERT_VIOLATIONDATA_RACE (106 of 120 remaining) [2023-08-25 06:38:20,898 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err13ASSERT_VIOLATIONDATA_RACE (105 of 120 remaining) [2023-08-25 06:38:20,898 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err14ASSERT_VIOLATIONDATA_RACE (104 of 120 remaining) [2023-08-25 06:38:20,898 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err15ASSERT_VIOLATIONDATA_RACE (103 of 120 remaining) [2023-08-25 06:38:20,898 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err16ASSERT_VIOLATIONDATA_RACE (102 of 120 remaining) [2023-08-25 06:38:20,898 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err21ASSERT_VIOLATIONDATA_RACE (101 of 120 remaining) [2023-08-25 06:38:20,898 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err22ASSERT_VIOLATIONDATA_RACE (100 of 120 remaining) [2023-08-25 06:38:20,898 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err17ASSERT_VIOLATIONDATA_RACE (99 of 120 remaining) [2023-08-25 06:38:20,898 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err18ASSERT_VIOLATIONDATA_RACE (98 of 120 remaining) [2023-08-25 06:38:20,898 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err19ASSERT_VIOLATIONDATA_RACE (97 of 120 remaining) [2023-08-25 06:38:20,898 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err20ASSERT_VIOLATIONDATA_RACE (96 of 120 remaining) [2023-08-25 06:38:20,898 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (95 of 120 remaining) [2023-08-25 06:38:20,899 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (94 of 120 remaining) [2023-08-25 06:38:20,899 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (93 of 120 remaining) [2023-08-25 06:38:20,899 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (92 of 120 remaining) [2023-08-25 06:38:20,899 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (91 of 120 remaining) [2023-08-25 06:38:20,899 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (90 of 120 remaining) [2023-08-25 06:38:20,899 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (89 of 120 remaining) [2023-08-25 06:38:20,899 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (88 of 120 remaining) [2023-08-25 06:38:20,899 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONDATA_RACE (87 of 120 remaining) [2023-08-25 06:38:20,899 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONDATA_RACE (86 of 120 remaining) [2023-08-25 06:38:20,899 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONDATA_RACE (85 of 120 remaining) [2023-08-25 06:38:20,899 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONDATA_RACE (84 of 120 remaining) [2023-08-25 06:38:20,899 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONDATA_RACE (83 of 120 remaining) [2023-08-25 06:38:20,899 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONDATA_RACE (82 of 120 remaining) [2023-08-25 06:38:20,899 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14ASSERT_VIOLATIONDATA_RACE (81 of 120 remaining) [2023-08-25 06:38:20,899 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15ASSERT_VIOLATIONDATA_RACE (80 of 120 remaining) [2023-08-25 06:38:20,900 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err16ASSERT_VIOLATIONDATA_RACE (79 of 120 remaining) [2023-08-25 06:38:20,900 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err17ASSERT_VIOLATIONDATA_RACE (78 of 120 remaining) [2023-08-25 06:38:20,900 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err18ASSERT_VIOLATIONDATA_RACE (77 of 120 remaining) [2023-08-25 06:38:20,900 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err19ASSERT_VIOLATIONDATA_RACE (76 of 120 remaining) [2023-08-25 06:38:20,900 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err20ASSERT_VIOLATIONDATA_RACE (75 of 120 remaining) [2023-08-25 06:38:20,900 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err21ASSERT_VIOLATIONDATA_RACE (74 of 120 remaining) [2023-08-25 06:38:20,900 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err22ASSERT_VIOLATIONDATA_RACE (73 of 120 remaining) [2023-08-25 06:38:20,900 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err23ASSERT_VIOLATIONDATA_RACE (72 of 120 remaining) [2023-08-25 06:38:20,900 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err24ASSERT_VIOLATIONDATA_RACE (71 of 120 remaining) [2023-08-25 06:38:20,900 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (70 of 120 remaining) [2023-08-25 06:38:20,900 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (69 of 120 remaining) [2023-08-25 06:38:20,900 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (68 of 120 remaining) [2023-08-25 06:38:20,900 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (67 of 120 remaining) [2023-08-25 06:38:20,900 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (66 of 120 remaining) [2023-08-25 06:38:20,900 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (65 of 120 remaining) [2023-08-25 06:38:20,901 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (64 of 120 remaining) [2023-08-25 06:38:20,901 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (63 of 120 remaining) [2023-08-25 06:38:20,901 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (62 of 120 remaining) [2023-08-25 06:38:20,901 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (61 of 120 remaining) [2023-08-25 06:38:20,901 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (60 of 120 remaining) [2023-08-25 06:38:20,901 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (59 of 120 remaining) [2023-08-25 06:38:20,901 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (58 of 120 remaining) [2023-08-25 06:38:20,901 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (57 of 120 remaining) [2023-08-25 06:38:20,901 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (56 of 120 remaining) [2023-08-25 06:38:20,901 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (55 of 120 remaining) [2023-08-25 06:38:20,901 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (54 of 120 remaining) [2023-08-25 06:38:20,901 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (53 of 120 remaining) [2023-08-25 06:38:20,901 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (52 of 120 remaining) [2023-08-25 06:38:20,901 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (51 of 120 remaining) [2023-08-25 06:38:20,901 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (50 of 120 remaining) [2023-08-25 06:38:20,901 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 120 remaining) [2023-08-25 06:38:20,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 120 remaining) [2023-08-25 06:38:20,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (47 of 120 remaining) [2023-08-25 06:38:20,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (46 of 120 remaining) [2023-08-25 06:38:20,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (45 of 120 remaining) [2023-08-25 06:38:20,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (44 of 120 remaining) [2023-08-25 06:38:20,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (43 of 120 remaining) [2023-08-25 06:38:20,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (42 of 120 remaining) [2023-08-25 06:38:20,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (41 of 120 remaining) [2023-08-25 06:38:20,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (40 of 120 remaining) [2023-08-25 06:38:20,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONDATA_RACE (39 of 120 remaining) [2023-08-25 06:38:20,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONDATA_RACE (38 of 120 remaining) [2023-08-25 06:38:20,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err10ASSERT_VIOLATIONDATA_RACE (37 of 120 remaining) [2023-08-25 06:38:20,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err11ASSERT_VIOLATIONDATA_RACE (36 of 120 remaining) [2023-08-25 06:38:20,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err12ASSERT_VIOLATIONDATA_RACE (35 of 120 remaining) [2023-08-25 06:38:20,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err13ASSERT_VIOLATIONDATA_RACE (34 of 120 remaining) [2023-08-25 06:38:20,902 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err14ASSERT_VIOLATIONDATA_RACE (33 of 120 remaining) [2023-08-25 06:38:20,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err15ASSERT_VIOLATIONDATA_RACE (32 of 120 remaining) [2023-08-25 06:38:20,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err16ASSERT_VIOLATIONDATA_RACE (31 of 120 remaining) [2023-08-25 06:38:20,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err21ASSERT_VIOLATIONDATA_RACE (30 of 120 remaining) [2023-08-25 06:38:20,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err22ASSERT_VIOLATIONDATA_RACE (29 of 120 remaining) [2023-08-25 06:38:20,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err17ASSERT_VIOLATIONDATA_RACE (28 of 120 remaining) [2023-08-25 06:38:20,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err18ASSERT_VIOLATIONDATA_RACE (27 of 120 remaining) [2023-08-25 06:38:20,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err19ASSERT_VIOLATIONDATA_RACE (26 of 120 remaining) [2023-08-25 06:38:20,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err20ASSERT_VIOLATIONDATA_RACE (25 of 120 remaining) [2023-08-25 06:38:20,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 120 remaining) [2023-08-25 06:38:20,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 120 remaining) [2023-08-25 06:38:20,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 120 remaining) [2023-08-25 06:38:20,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 120 remaining) [2023-08-25 06:38:20,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 120 remaining) [2023-08-25 06:38:20,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (19 of 120 remaining) [2023-08-25 06:38:20,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 120 remaining) [2023-08-25 06:38:20,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (17 of 120 remaining) [2023-08-25 06:38:20,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONDATA_RACE (16 of 120 remaining) [2023-08-25 06:38:20,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONDATA_RACE (15 of 120 remaining) [2023-08-25 06:38:20,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONDATA_RACE (14 of 120 remaining) [2023-08-25 06:38:20,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONDATA_RACE (13 of 120 remaining) [2023-08-25 06:38:20,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 120 remaining) [2023-08-25 06:38:20,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONDATA_RACE (11 of 120 remaining) [2023-08-25 06:38:20,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14ASSERT_VIOLATIONDATA_RACE (10 of 120 remaining) [2023-08-25 06:38:20,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15ASSERT_VIOLATIONDATA_RACE (9 of 120 remaining) [2023-08-25 06:38:20,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err16ASSERT_VIOLATIONDATA_RACE (8 of 120 remaining) [2023-08-25 06:38:20,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err17ASSERT_VIOLATIONDATA_RACE (7 of 120 remaining) [2023-08-25 06:38:20,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err18ASSERT_VIOLATIONDATA_RACE (6 of 120 remaining) [2023-08-25 06:38:20,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err19ASSERT_VIOLATIONDATA_RACE (5 of 120 remaining) [2023-08-25 06:38:20,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err20ASSERT_VIOLATIONDATA_RACE (4 of 120 remaining) [2023-08-25 06:38:20,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err21ASSERT_VIOLATIONDATA_RACE (3 of 120 remaining) [2023-08-25 06:38:20,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err22ASSERT_VIOLATIONDATA_RACE (2 of 120 remaining) [2023-08-25 06:38:20,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err23ASSERT_VIOLATIONDATA_RACE (1 of 120 remaining) [2023-08-25 06:38:20,904 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err24ASSERT_VIOLATIONDATA_RACE (0 of 120 remaining) [2023-08-25 06:38:20,905 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 06:38:20,909 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 06:38:20,909 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 06:38:20,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 06:38:20 BasicIcfg [2023-08-25 06:38:20,910 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 06:38:20,911 INFO L158 Benchmark]: Toolchain (without parser) took 835611.54ms. Allocated memory was 392.2MB in the beginning and 10.3GB in the end (delta: 9.9GB). Free memory was 368.6MB in the beginning and 5.7GB in the end (delta: -5.3GB). Peak memory consumption was 9.2GB. Max. memory is 16.0GB. [2023-08-25 06:38:20,911 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 392.2MB. Free memory is still 369.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 06:38:20,911 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.05ms. Allocated memory is still 392.2MB. Free memory was 368.1MB in the beginning and 355.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-25 06:38:20,911 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.78ms. Allocated memory is still 392.2MB. Free memory was 355.4MB in the beginning and 352.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 06:38:20,911 INFO L158 Benchmark]: Boogie Preprocessor took 59.55ms. Allocated memory is still 392.2MB. Free memory was 351.6MB in the beginning and 349.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 06:38:20,911 INFO L158 Benchmark]: RCFGBuilder took 917.54ms. Allocated memory is still 392.2MB. Free memory was 349.1MB in the beginning and 311.6MB in the end (delta: 37.4MB). Peak memory consumption was 42.8MB. Max. memory is 16.0GB. [2023-08-25 06:38:20,911 INFO L158 Benchmark]: TraceAbstraction took 834393.74ms. Allocated memory was 392.2MB in the beginning and 10.3GB in the end (delta: 9.9GB). Free memory was 310.7MB in the beginning and 5.7GB in the end (delta: -5.4GB). Peak memory consumption was 9.1GB. Max. memory is 16.0GB. [2023-08-25 06:38:20,912 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 392.2MB. Free memory is still 369.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 181.05ms. Allocated memory is still 392.2MB. Free memory was 368.1MB in the beginning and 355.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.78ms. Allocated memory is still 392.2MB. Free memory was 355.4MB in the beginning and 352.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 59.55ms. Allocated memory is still 392.2MB. Free memory was 351.6MB in the beginning and 349.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 917.54ms. Allocated memory is still 392.2MB. Free memory was 349.1MB in the beginning and 311.6MB in the end (delta: 37.4MB). Peak memory consumption was 42.8MB. Max. memory is 16.0GB. * TraceAbstraction took 834393.74ms. Allocated memory was 392.2MB in the beginning and 10.3GB in the end (delta: 9.9GB). Free memory was 310.7MB in the beginning and 5.7GB in the end (delta: -5.4GB). Peak memory consumption was 9.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.1s, 357 PlacesBefore, 120 PlacesAfterwards, 366 TransitionsBefore, 119 TransitionsAfterwards, 11388 CoEnabledTransitionPairs, 9 FixpointIterations, 251 TrivialSequentialCompositions, 134 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 8 ConcurrentYvCompositions, 10 ChoiceCompositions, 429 TotalNumberOfCompositions, 60421 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19213, independent: 18167, independent conditional: 0, independent unconditional: 18167, dependent: 1046, dependent conditional: 0, dependent unconditional: 1046, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5528, independent: 5385, independent conditional: 0, independent unconditional: 5385, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 19213, independent: 12782, independent conditional: 0, independent unconditional: 12782, dependent: 903, dependent conditional: 0, dependent unconditional: 903, unknown: 5528, unknown conditional: 0, unknown unconditional: 5528] , Statistics on independence cache: Total cache size (in pairs): 701, Positive cache size: 618, Positive conditional cache size: 0, Positive unconditional cache size: 618, Negative cache size: 83, Negative conditional cache size: 0, Negative unconditional cache size: 83, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 53]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 53]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 118]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 118]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 78 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 50ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 482 locations, 120 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 834.2s, OverallIterations: 20, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 80.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.3s, HoareTripleCheckerStatistics: 76 mSolverCounterUnknown, 3041 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3041 mSDsluCounter, 1027 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 938 mSDsCounter, 218 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7716 IncrementalHoareTripleChecker+Invalid, 8010 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 218 mSolverCounterUnsat, 89 mSDtfsCounter, 7716 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 794 GetRequests, 568 SyntacticMatches, 5 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2002 ImplicationChecksByTransitivity, 30.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4353occurred in iteration=16, InterpolantAutomatonStates: 166, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 14.3s SatisfiabilityAnalysisTime, 30.6s InterpolantComputationTime, 1018 NumberOfCodeBlocks, 1018 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1305 ConstructedInterpolants, 86 QuantifiedInterpolants, 21798 SizeOfPredicates, 185 NumberOfNonLiveVariables, 2925 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 31 InterpolantComputations, 14 PerfectInterpolantSequences, 240/336 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown