/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 --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -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/bench-exp1x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 08:19:13,264 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 08:19:13,331 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-26 08:19:13,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 08:19:13,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 08:19:13,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 08:19:13,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 08:19:13,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 08:19:13,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 08:19:13,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 08:19:13,365 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 08:19:13,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 08:19:13,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 08:19:13,366 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 08:19:13,366 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 08:19:13,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 08:19:13,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 08:19:13,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 08:19:13,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 08:19:13,367 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 08:19:13,367 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 08:19:13,367 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 08:19:13,368 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 08:19:13,368 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 08:19:13,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 08:19:13,368 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 08:19:13,368 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 08:19:13,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 08:19:13,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 08:19:13,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 08:19:13,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 08:19:13,370 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 08:19:13,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 08:19:13,370 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 08:19:13,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 08:19:13,370 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.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST 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-26 08:19:13,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 08:19:13,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 08:19:13,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 08:19:13,587 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 08:19:13,588 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 08:19:13,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-08-26 08:19:14,471 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 08:19:14,624 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 08:19:14,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-08-26 08:19:14,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21351693d/3c677d7e6579459bb88edf5ad53b9cca/FLAG0dc35fd21 [2023-08-26 08:19:14,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21351693d/3c677d7e6579459bb88edf5ad53b9cca [2023-08-26 08:19:14,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 08:19:14,647 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 08:19:14,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 08:19:14,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 08:19:14,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 08:19:14,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:19:14" (1/1) ... [2023-08-26 08:19:14,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b12d047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:19:14, skipping insertion in model container [2023-08-26 08:19:14,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:19:14" (1/1) ... [2023-08-26 08:19:14,667 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 08:19:14,779 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 08:19:14,787 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 08:19:14,815 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 08:19:14,827 INFO L206 MainTranslator]: Completed translation [2023-08-26 08:19:14,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:19:14 WrapperNode [2023-08-26 08:19:14,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 08:19:14,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 08:19:14,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 08:19:14,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 08:19:14,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:19:14" (1/1) ... [2023-08-26 08:19:14,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:19:14" (1/1) ... [2023-08-26 08:19:14,871 INFO L138 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 98 [2023-08-26 08:19:14,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 08:19:14,872 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 08:19:14,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 08:19:14,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 08:19:14,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:19:14" (1/1) ... [2023-08-26 08:19:14,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:19:14" (1/1) ... [2023-08-26 08:19:14,889 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:19:14" (1/1) ... [2023-08-26 08:19:14,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:19:14" (1/1) ... [2023-08-26 08:19:14,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:19:14" (1/1) ... [2023-08-26 08:19:14,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:19:14" (1/1) ... [2023-08-26 08:19:14,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:19:14" (1/1) ... [2023-08-26 08:19:14,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:19:14" (1/1) ... [2023-08-26 08:19:14,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 08:19:14,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 08:19:14,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 08:19:14,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 08:19:14,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:19:14" (1/1) ... [2023-08-26 08:19:14,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 08:19:14,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:19:14,926 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-26 08:19:14,932 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-26 08:19:14,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 08:19:14,951 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 08:19:14,951 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 08:19:14,951 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 08:19:14,951 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 08:19:14,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 08:19:14,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 08:19:14,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 08:19:14,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 08:19:14,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 08:19:14,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 08:19:14,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 08:19:14,953 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 08:19:15,034 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 08:19:15,036 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 08:19:15,261 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 08:19:15,266 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 08:19:15,267 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-26 08:19:15,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:19:15 BoogieIcfgContainer [2023-08-26 08:19:15,268 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 08:19:15,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 08:19:15,270 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 08:19:15,271 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 08:19:15,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 08:19:14" (1/3) ... [2023-08-26 08:19:15,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160623b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:19:15, skipping insertion in model container [2023-08-26 08:19:15,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:19:14" (2/3) ... [2023-08-26 08:19:15,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160623b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:19:15, skipping insertion in model container [2023-08-26 08:19:15,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:19:15" (3/3) ... [2023-08-26 08:19:15,273 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2023-08-26 08:19:15,290 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 08:19:15,290 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2023-08-26 08:19:15,290 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 08:19:15,331 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 08:19:15,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 159 transitions, 334 flow [2023-08-26 08:19:15,400 INFO L124 PetriNetUnfolderBase]: 7/157 cut-off events. [2023-08-26 08:19:15,401 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 08:19:15,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 157 events. 7/157 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 167 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-08-26 08:19:15,405 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 159 transitions, 334 flow [2023-08-26 08:19:15,437 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 148 transitions, 308 flow [2023-08-26 08:19:15,440 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 08:19:15,447 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 148 transitions, 308 flow [2023-08-26 08:19:15,449 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 148 transitions, 308 flow [2023-08-26 08:19:15,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 148 transitions, 308 flow [2023-08-26 08:19:15,481 INFO L124 PetriNetUnfolderBase]: 7/148 cut-off events. [2023-08-26 08:19:15,481 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 08:19:15,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 148 events. 7/148 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 166 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-08-26 08:19:15,484 INFO L119 LiptonReduction]: Number of co-enabled transitions 2576 [2023-08-26 08:19:18,774 INFO L134 LiptonReduction]: Checked pairs total: 4912 [2023-08-26 08:19:18,775 INFO L136 LiptonReduction]: Total number of compositions: 185 [2023-08-26 08:19:18,784 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 08:19:18,788 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;@158aa1ea, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 08:19:18,788 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2023-08-26 08:19:18,789 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 08:19:18,789 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 08:19:18,789 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 08:19:18,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:19:18,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 08:19:18,790 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-26 08:19:18,793 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:19:18,793 INFO L85 PathProgramCache]: Analyzing trace with hash 605, now seen corresponding path program 1 times [2023-08-26 08:19:18,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:19:18,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54843680] [2023-08-26 08:19:18,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:19:18,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:19:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:19:18,853 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-26 08:19:18,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:19:18,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54843680] [2023-08-26 08:19:18,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54843680] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:19:18,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:19:18,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 08:19:18,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960609074] [2023-08-26 08:19:18,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:19:18,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 08:19:18,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:19:18,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 08:19:18,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 08:19:18,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 344 [2023-08-26 08:19:18,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 86 flow. Second operand has 2 states, 2 states have (on average 150.5) internal successors, (301), 2 states have internal predecessors, (301), 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-26 08:19:18,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:19:18,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 344 [2023-08-26 08:19:18,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:19:18,928 INFO L124 PetriNetUnfolderBase]: 40/81 cut-off events. [2023-08-26 08:19:18,928 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-08-26 08:19:18,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 81 events. 40/81 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 179 event pairs, 24 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 128. Up to 74 conditions per place. [2023-08-26 08:19:18,930 INFO L140 encePairwiseOnDemand]: 324/344 looper letters, 15 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2023-08-26 08:19:18,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 17 transitions, 76 flow [2023-08-26 08:19:18,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 08:19:18,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 08:19:18,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 335 transitions. [2023-08-26 08:19:18,944 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48691860465116277 [2023-08-26 08:19:18,944 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 335 transitions. [2023-08-26 08:19:18,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 335 transitions. [2023-08-26 08:19:18,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:19:18,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 335 transitions. [2023-08-26 08:19:18,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 167.5) internal successors, (335), 2 states have internal predecessors, (335), 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-26 08:19:18,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 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-26 08:19:18,955 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 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-26 08:19:18,957 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 86 flow. Second operand 2 states and 335 transitions. [2023-08-26 08:19:18,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 17 transitions, 76 flow [2023-08-26 08:19:18,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 17 transitions, 68 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 08:19:18,961 INFO L231 Difference]: Finished difference. Result has 19 places, 17 transitions, 38 flow [2023-08-26 08:19:18,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=38, PETRI_PLACES=19, PETRI_TRANSITIONS=17} [2023-08-26 08:19:18,965 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -21 predicate places. [2023-08-26 08:19:18,965 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 38 flow [2023-08-26 08:19:18,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 150.5) internal successors, (301), 2 states have internal predecessors, (301), 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-26 08:19:18,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:19:18,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 08:19:18,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 08:19:18,966 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-26 08:19:18,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:19:18,967 INFO L85 PathProgramCache]: Analyzing trace with hash 18624315, now seen corresponding path program 1 times [2023-08-26 08:19:18,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:19:18,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992367471] [2023-08-26 08:19:18,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:19:18,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:19:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:19:19,034 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-26 08:19:19,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:19:19,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992367471] [2023-08-26 08:19:19,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992367471] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:19:19,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:19:19,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 08:19:19,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68983689] [2023-08-26 08:19:19,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:19:19,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:19:19,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:19:19,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:19:19,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:19:19,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 344 [2023-08-26 08:19:19,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 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-26 08:19:19,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:19:19,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 344 [2023-08-26 08:19:19,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:19:19,073 INFO L124 PetriNetUnfolderBase]: 45/82 cut-off events. [2023-08-26 08:19:19,073 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 08:19:19,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 82 events. 45/82 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 163 event pairs, 8 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 169. Up to 77 conditions per place. [2023-08-26 08:19:19,074 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 18 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2023-08-26 08:19:19,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 20 transitions, 85 flow [2023-08-26 08:19:19,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:19:19,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:19:19,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-08-26 08:19:19,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4312015503875969 [2023-08-26 08:19:19,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-08-26 08:19:19,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-08-26 08:19:19,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:19:19,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-08-26 08:19:19,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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-26 08:19:19,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-26 08:19:19,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-26 08:19:19,079 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 38 flow. Second operand 3 states and 445 transitions. [2023-08-26 08:19:19,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 20 transitions, 85 flow [2023-08-26 08:19:19,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 20 transitions, 85 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:19:19,079 INFO L231 Difference]: Finished difference. Result has 20 places, 17 transitions, 48 flow [2023-08-26 08:19:19,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=20, PETRI_TRANSITIONS=17} [2023-08-26 08:19:19,080 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -20 predicate places. [2023-08-26 08:19:19,080 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 48 flow [2023-08-26 08:19:19,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 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-26 08:19:19,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:19:19,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:19:19,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 08:19:19,081 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-26 08:19:19,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:19:19,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1689284570, now seen corresponding path program 1 times [2023-08-26 08:19:19,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:19:19,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175761648] [2023-08-26 08:19:19,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:19:19,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:19:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:19:19,305 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-26 08:19:19,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:19:19,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175761648] [2023-08-26 08:19:19,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175761648] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:19:19,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:19:19,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 08:19:19,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491900563] [2023-08-26 08:19:19,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:19:19,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:19:19,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:19:19,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:19:19,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:19:19,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 344 [2023-08-26 08:19:19,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 17 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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-26 08:19:19,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:19:19,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 344 [2023-08-26 08:19:19,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:19:19,354 INFO L124 PetriNetUnfolderBase]: 79/143 cut-off events. [2023-08-26 08:19:19,354 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-26 08:19:19,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 143 events. 79/143 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 391 event pairs, 20 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 331. Up to 88 conditions per place. [2023-08-26 08:19:19,365 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 25 selfloop transitions, 3 changer transitions 1/29 dead transitions. [2023-08-26 08:19:19,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 29 transitions, 137 flow [2023-08-26 08:19:19,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:19:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:19:19,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-08-26 08:19:19,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4253875968992248 [2023-08-26 08:19:19,367 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-08-26 08:19:19,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-08-26 08:19:19,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:19:19,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-08-26 08:19:19,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 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-26 08:19:19,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-26 08:19:19,370 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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-26 08:19:19,370 INFO L175 Difference]: Start difference. First operand has 20 places, 17 transitions, 48 flow. Second operand 3 states and 439 transitions. [2023-08-26 08:19:19,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 29 transitions, 137 flow [2023-08-26 08:19:19,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 29 transitions, 137 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:19:19,371 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 67 flow [2023-08-26 08:19:19,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2023-08-26 08:19:19,372 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -17 predicate places. [2023-08-26 08:19:19,372 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 67 flow [2023-08-26 08:19:19,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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-26 08:19:19,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:19:19,373 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:19:19,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 08:19:19,375 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-26 08:19:19,376 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:19:19,376 INFO L85 PathProgramCache]: Analyzing trace with hash 147101233, now seen corresponding path program 1 times [2023-08-26 08:19:19,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:19:19,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363118837] [2023-08-26 08:19:19,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:19:19,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:19:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:19:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:19:19,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:19:19,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363118837] [2023-08-26 08:19:19,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363118837] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:19:19,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:19:19,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:19:19,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591668881] [2023-08-26 08:19:19,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:19:19,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:19:19,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:19:19,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:19:19,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:19:19,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-26 08:19:19,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 67 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 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-26 08:19:19,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:19:19,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-26 08:19:19,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:19:19,526 INFO L124 PetriNetUnfolderBase]: 77/141 cut-off events. [2023-08-26 08:19:19,526 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-08-26 08:19:19,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 141 events. 77/141 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 385 event pairs, 9 based on Foata normal form. 2/143 useless extension candidates. Maximal degree in co-relation 373. Up to 49 conditions per place. [2023-08-26 08:19:19,527 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 32 selfloop transitions, 6 changer transitions 5/43 dead transitions. [2023-08-26 08:19:19,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 43 transitions, 221 flow [2023-08-26 08:19:19,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 08:19:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 08:19:19,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 717 transitions. [2023-08-26 08:19:19,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41686046511627906 [2023-08-26 08:19:19,529 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 717 transitions. [2023-08-26 08:19:19,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 717 transitions. [2023-08-26 08:19:19,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:19:19,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 717 transitions. [2023-08-26 08:19:19,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.4) internal successors, (717), 5 states have internal predecessors, (717), 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-26 08:19:19,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 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-26 08:19:19,533 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 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-26 08:19:19,533 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 67 flow. Second operand 5 states and 717 transitions. [2023-08-26 08:19:19,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 43 transitions, 221 flow [2023-08-26 08:19:19,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 43 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 08:19:19,535 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 88 flow [2023-08-26 08:19:19,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2023-08-26 08:19:19,536 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -13 predicate places. [2023-08-26 08:19:19,536 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 88 flow [2023-08-26 08:19:19,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 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-26 08:19:19,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:19:19,537 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:19:19,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 08:19:19,537 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-26 08:19:19,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:19:19,537 INFO L85 PathProgramCache]: Analyzing trace with hash 494047363, now seen corresponding path program 1 times [2023-08-26 08:19:19,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:19:19,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328370590] [2023-08-26 08:19:19,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:19:19,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:19:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:19:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:19:19,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:19:19,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328370590] [2023-08-26 08:19:19,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328370590] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:19:19,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:19:19,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:19:19,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804986412] [2023-08-26 08:19:19,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:19:19,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:19:19,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:19:19,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:19:19,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:19:19,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-26 08:19:19,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 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-26 08:19:19,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:19:19,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-26 08:19:19,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:19:19,642 INFO L124 PetriNetUnfolderBase]: 67/127 cut-off events. [2023-08-26 08:19:19,643 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-08-26 08:19:19,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 127 events. 67/127 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 343 event pairs, 7 based on Foata normal form. 4/131 useless extension candidates. Maximal degree in co-relation 378. Up to 61 conditions per place. [2023-08-26 08:19:19,645 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 26 selfloop transitions, 4 changer transitions 9/39 dead transitions. [2023-08-26 08:19:19,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 39 transitions, 217 flow [2023-08-26 08:19:19,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 08:19:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 08:19:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 713 transitions. [2023-08-26 08:19:19,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4145348837209302 [2023-08-26 08:19:19,651 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 713 transitions. [2023-08-26 08:19:19,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 713 transitions. [2023-08-26 08:19:19,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:19:19,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 713 transitions. [2023-08-26 08:19:19,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.6) internal successors, (713), 5 states have internal predecessors, (713), 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-26 08:19:19,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 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-26 08:19:19,656 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 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-26 08:19:19,656 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 88 flow. Second operand 5 states and 713 transitions. [2023-08-26 08:19:19,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 39 transitions, 217 flow [2023-08-26 08:19:19,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 39 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 08:19:19,657 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 82 flow [2023-08-26 08:19:19,657 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2023-08-26 08:19:19,659 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -10 predicate places. [2023-08-26 08:19:19,659 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 82 flow [2023-08-26 08:19:19,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 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-26 08:19:19,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:19:19,659 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:19:19,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 08:19:19,660 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-26 08:19:19,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:19:19,660 INFO L85 PathProgramCache]: Analyzing trace with hash 567858883, now seen corresponding path program 2 times [2023-08-26 08:19:19,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:19:19,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833387107] [2023-08-26 08:19:19,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:19:19,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:19:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:19:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:19:19,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:19:19,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833387107] [2023-08-26 08:19:19,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833387107] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:19:19,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613888075] [2023-08-26 08:19:19,720 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 08:19:19,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:19:19,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:19:19,722 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-26 08:19:19,740 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-26 08:19:19,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 08:19:19,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 08:19:19,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 08:19:19,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:19:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:19:19,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:19:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:19:19,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613888075] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:19:19,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:19:19,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-26 08:19:19,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059196201] [2023-08-26 08:19:19,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:19:19,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:19:19,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:19:19,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:19:19,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:19:19,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-26 08:19:19,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 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-26 08:19:19,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:19:19,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-26 08:19:19,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:19:20,016 INFO L124 PetriNetUnfolderBase]: 78/139 cut-off events. [2023-08-26 08:19:20,016 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-08-26 08:19:20,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 139 events. 78/139 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 337 event pairs, 13 based on Foata normal form. 8/147 useless extension candidates. Maximal degree in co-relation 427. Up to 72 conditions per place. [2023-08-26 08:19:20,017 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 31 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2023-08-26 08:19:20,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 213 flow [2023-08-26 08:19:20,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 08:19:20,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 08:19:20,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2023-08-26 08:19:20,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.413953488372093 [2023-08-26 08:19:20,019 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2023-08-26 08:19:20,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2023-08-26 08:19:20,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:19:20,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2023-08-26 08:19:20,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 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-26 08:19:20,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 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-26 08:19:20,023 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 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-26 08:19:20,023 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 82 flow. Second operand 5 states and 712 transitions. [2023-08-26 08:19:20,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 213 flow [2023-08-26 08:19:20,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 37 transitions, 203 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 08:19:20,025 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 109 flow [2023-08-26 08:19:20,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-08-26 08:19:20,029 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-08-26 08:19:20,029 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 109 flow [2023-08-26 08:19:20,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 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-26 08:19:20,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:19:20,030 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:19:20,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-26 08:19:20,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-26 08:19:20,234 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-26 08:19:20,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:19:20,235 INFO L85 PathProgramCache]: Analyzing trace with hash 73483995, now seen corresponding path program 2 times [2023-08-26 08:19:20,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:19:20,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029973974] [2023-08-26 08:19:20,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:19:20,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:19:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:19:20,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:19:20,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:19:20,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029973974] [2023-08-26 08:19:20,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029973974] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:19:20,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28102752] [2023-08-26 08:19:20,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 08:19:20,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:19:20,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:19:20,271 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-26 08:19:20,273 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-26 08:19:20,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 08:19:20,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 08:19:20,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 08:19:20,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:19:20,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:19:20,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:19:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:19:20,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28102752] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:19:20,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:19:20,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-26 08:19:20,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349703301] [2023-08-26 08:19:20,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:19:20,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:19:20,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:19:20,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:19:20,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:19:20,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-26 08:19:20,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 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-26 08:19:20,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:19:20,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-26 08:19:20,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:19:20,478 INFO L124 PetriNetUnfolderBase]: 96/169 cut-off events. [2023-08-26 08:19:20,478 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2023-08-26 08:19:20,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 169 events. 96/169 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 432 event pairs, 17 based on Foata normal form. 6/175 useless extension candidates. Maximal degree in co-relation 572. Up to 122 conditions per place. [2023-08-26 08:19:20,479 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 30 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2023-08-26 08:19:20,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 234 flow [2023-08-26 08:19:20,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 08:19:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 08:19:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2023-08-26 08:19:20,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4116279069767442 [2023-08-26 08:19:20,481 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 708 transitions. [2023-08-26 08:19:20,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 708 transitions. [2023-08-26 08:19:20,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:19:20,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 708 transitions. [2023-08-26 08:19:20,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.6) internal successors, (708), 5 states have internal predecessors, (708), 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-26 08:19:20,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 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-26 08:19:20,484 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 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-26 08:19:20,484 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 109 flow. Second operand 5 states and 708 transitions. [2023-08-26 08:19:20,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 234 flow [2023-08-26 08:19:20,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 229 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 08:19:20,486 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 145 flow [2023-08-26 08:19:20,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-26 08:19:20,486 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-08-26 08:19:20,486 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 145 flow [2023-08-26 08:19:20,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 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-26 08:19:20,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:19:20,487 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:19:20,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 08:19:20,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-08-26 08:19:20,693 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-26 08:19:20,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:19:20,694 INFO L85 PathProgramCache]: Analyzing trace with hash 335338564, now seen corresponding path program 1 times [2023-08-26 08:19:20,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:19:20,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526811682] [2023-08-26 08:19:20,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:19:20,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:19:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:19:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:19:20,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:19:20,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526811682] [2023-08-26 08:19:20,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526811682] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:19:20,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014400599] [2023-08-26 08:19:20,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:19:20,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:19:20,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:19:20,964 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-26 08:19:20,969 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-26 08:19:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:19:21,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-26 08:19:21,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:19:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:19:25,122 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:19:28,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:19:28,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014400599] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:19:28,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:19:28,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-26 08:19:28,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907527881] [2023-08-26 08:19:28,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:19:28,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-26 08:19:28,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:19:28,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-26 08:19:28,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-08-26 08:19:28,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-26 08:19:28,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 145 flow. Second operand has 15 states, 15 states have (on average 137.73333333333332) internal successors, (2066), 15 states have internal predecessors, (2066), 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-26 08:19:28,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:19:28,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-26 08:19:28,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:19:37,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:19:45,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:19:46,443 INFO L124 PetriNetUnfolderBase]: 323/589 cut-off events. [2023-08-26 08:19:46,443 INFO L125 PetriNetUnfolderBase]: For 1077/1077 co-relation queries the response was YES. [2023-08-26 08:19:46,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2158 conditions, 589 events. 323/589 cut-off events. For 1077/1077 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2373 event pairs, 19 based on Foata normal form. 7/596 useless extension candidates. Maximal degree in co-relation 2145. Up to 152 conditions per place. [2023-08-26 08:19:46,446 INFO L140 encePairwiseOnDemand]: 338/344 looper letters, 83 selfloop transitions, 30 changer transitions 20/133 dead transitions. [2023-08-26 08:19:46,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 133 transitions, 916 flow [2023-08-26 08:19:46,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-26 08:19:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-26 08:19:46,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2152 transitions. [2023-08-26 08:19:46,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4170542635658915 [2023-08-26 08:19:46,451 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2152 transitions. [2023-08-26 08:19:46,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2152 transitions. [2023-08-26 08:19:46,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:19:46,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2152 transitions. [2023-08-26 08:19:46,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 143.46666666666667) internal successors, (2152), 15 states have internal predecessors, (2152), 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-26 08:19:46,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 344.0) internal successors, (5504), 16 states have internal predecessors, (5504), 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-26 08:19:46,463 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 344.0) internal successors, (5504), 16 states have internal predecessors, (5504), 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-26 08:19:46,463 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 145 flow. Second operand 15 states and 2152 transitions. [2023-08-26 08:19:46,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 133 transitions, 916 flow [2023-08-26 08:19:46,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 133 transitions, 901 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 08:19:46,469 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 459 flow [2023-08-26 08:19:46,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=459, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-08-26 08:19:46,471 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2023-08-26 08:19:46,471 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 459 flow [2023-08-26 08:19:46,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 137.73333333333332) internal successors, (2066), 15 states have internal predecessors, (2066), 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-26 08:19:46,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:19:46,472 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:19:46,484 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-26 08:19:46,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:19:46,677 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-26 08:19:46,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:19:46,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1718693540, now seen corresponding path program 2 times [2023-08-26 08:19:46,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:19:46,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843325729] [2023-08-26 08:19:46,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:19:46,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:19:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:19:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:19:46,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:19:46,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843325729] [2023-08-26 08:19:46,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843325729] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:19:46,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941143064] [2023-08-26 08:19:46,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 08:19:46,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:19:46,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:19:46,994 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-26 08:19:46,995 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-26 08:19:47,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 08:19:47,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 08:19:47,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-26 08:19:47,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:19:52,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:19:52,484 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:19:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:19:57,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941143064] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:19:57,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:19:57,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-26 08:19:57,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456521326] [2023-08-26 08:19:57,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:19:57,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-26 08:19:57,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:19:57,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-26 08:19:57,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=138, Unknown=3, NotChecked=0, Total=210 [2023-08-26 08:19:57,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-26 08:19:57,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 459 flow. Second operand has 15 states, 15 states have (on average 137.66666666666666) internal successors, (2065), 15 states have internal predecessors, (2065), 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-26 08:19:57,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:19:57,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-26 08:19:57,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:19:59,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:20:01,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:20:04,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:20:06,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:20:07,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:20:10,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:20:12,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:20:15,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:20:17,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:20:19,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:20:22,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:20:24,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:20:26,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:20:30,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:20:32,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 08:20:35,118 INFO L124 PetriNetUnfolderBase]: 483/878 cut-off events. [2023-08-26 08:20:35,118 INFO L125 PetriNetUnfolderBase]: For 4786/4786 co-relation queries the response was YES. [2023-08-26 08:20:35,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4061 conditions, 878 events. 483/878 cut-off events. For 4786/4786 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4049 event pairs, 63 based on Foata normal form. 8/886 useless extension candidates. Maximal degree in co-relation 4038. Up to 482 conditions per place. [2023-08-26 08:20:35,123 INFO L140 encePairwiseOnDemand]: 337/344 looper letters, 100 selfloop transitions, 32 changer transitions 15/147 dead transitions. [2023-08-26 08:20:35,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 147 transitions, 1355 flow [2023-08-26 08:20:35,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-26 08:20:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-26 08:20:35,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2141 transitions. [2023-08-26 08:20:35,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.414922480620155 [2023-08-26 08:20:35,130 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2141 transitions. [2023-08-26 08:20:35,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2141 transitions. [2023-08-26 08:20:35,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:20:35,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2141 transitions. [2023-08-26 08:20:35,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 142.73333333333332) internal successors, (2141), 15 states have internal predecessors, (2141), 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-26 08:20:35,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 344.0) internal successors, (5504), 16 states have internal predecessors, (5504), 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-26 08:20:35,143 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 344.0) internal successors, (5504), 16 states have internal predecessors, (5504), 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-26 08:20:35,143 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 459 flow. Second operand 15 states and 2141 transitions. [2023-08-26 08:20:35,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 147 transitions, 1355 flow [2023-08-26 08:20:35,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 147 transitions, 1218 flow, removed 67 selfloop flow, removed 2 redundant places. [2023-08-26 08:20:35,152 INFO L231 Difference]: Finished difference. Result has 77 places, 75 transitions, 674 flow [2023-08-26 08:20:35,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=674, PETRI_PLACES=77, PETRI_TRANSITIONS=75} [2023-08-26 08:20:35,153 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places. [2023-08-26 08:20:35,153 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 75 transitions, 674 flow [2023-08-26 08:20:35,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 137.66666666666666) internal successors, (2065), 15 states have internal predecessors, (2065), 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-26 08:20:35,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:20:35,154 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:20:35,161 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-26 08:20:35,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:20:35,359 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-26 08:20:35,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:20:35,360 INFO L85 PathProgramCache]: Analyzing trace with hash 29739985, now seen corresponding path program 3 times [2023-08-26 08:20:35,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:20:35,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162502717] [2023-08-26 08:20:35,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:20:35,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:20:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:20:35,452 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:20:35,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:20:35,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162502717] [2023-08-26 08:20:35,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162502717] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:20:35,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592369591] [2023-08-26 08:20:35,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 08:20:35,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:20:35,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:20:35,454 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-26 08:20:35,455 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-26 08:20:40,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-26 08:20:40,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 08:20:40,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-26 08:20:40,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:20:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:20:46,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:20:59,082 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:20:59,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592369591] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:20:59,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:20:59,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 14 [2023-08-26 08:20:59,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487528903] [2023-08-26 08:20:59,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:20:59,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-26 08:20:59,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:20:59,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-26 08:20:59,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=145, Unknown=6, NotChecked=0, Total=210 [2023-08-26 08:20:59,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-26 08:20:59,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 75 transitions, 674 flow. Second operand has 15 states, 15 states have (on average 138.4) internal successors, (2076), 15 states have internal predecessors, (2076), 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-26 08:20:59,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:20:59,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-26 08:20:59,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:21:03,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:21:08,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:21:10,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:21:46,119 WARN L234 SmtUtils]: Spent 34.77s on a formula simplification. DAG size of input: 55 DAG size of output: 41 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 08:21:51,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:21:53,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:21:56,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:22:15,721 WARN L234 SmtUtils]: Spent 12.31s on a formula simplification. DAG size of input: 48 DAG size of output: 20 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 08:22:17,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:22:19,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:22:22,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:22:24,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:22:26,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:22:28,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:22:30,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:23:02,159 INFO L124 PetriNetUnfolderBase]: 757/1365 cut-off events. [2023-08-26 08:23:02,159 INFO L125 PetriNetUnfolderBase]: For 12504/12504 co-relation queries the response was YES. [2023-08-26 08:23:02,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7152 conditions, 1365 events. 757/1365 cut-off events. For 12504/12504 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6712 event pairs, 55 based on Foata normal form. 38/1403 useless extension candidates. Maximal degree in co-relation 7121. Up to 367 conditions per place. [2023-08-26 08:23:02,168 INFO L140 encePairwiseOnDemand]: 338/344 looper letters, 121 selfloop transitions, 79 changer transitions 41/241 dead transitions. [2023-08-26 08:23:02,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 241 transitions, 2693 flow [2023-08-26 08:23:02,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-26 08:23:02,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-26 08:23:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3409 transitions. [2023-08-26 08:23:02,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41291182170542634 [2023-08-26 08:23:02,175 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3409 transitions. [2023-08-26 08:23:02,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3409 transitions. [2023-08-26 08:23:02,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:23:02,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3409 transitions. [2023-08-26 08:23:02,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 142.04166666666666) internal successors, (3409), 24 states have internal predecessors, (3409), 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-26 08:23:02,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 344.0) internal successors, (8600), 25 states have internal predecessors, (8600), 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-26 08:23:02,189 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 344.0) internal successors, (8600), 25 states have internal predecessors, (8600), 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-26 08:23:02,189 INFO L175 Difference]: Start difference. First operand has 77 places, 75 transitions, 674 flow. Second operand 24 states and 3409 transitions. [2023-08-26 08:23:02,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 241 transitions, 2693 flow [2023-08-26 08:23:02,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 241 transitions, 2478 flow, removed 101 selfloop flow, removed 6 redundant places. [2023-08-26 08:23:02,208 INFO L231 Difference]: Finished difference. Result has 102 places, 123 transitions, 1312 flow [2023-08-26 08:23:02,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1312, PETRI_PLACES=102, PETRI_TRANSITIONS=123} [2023-08-26 08:23:02,208 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 62 predicate places. [2023-08-26 08:23:02,208 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 123 transitions, 1312 flow [2023-08-26 08:23:02,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 138.4) internal successors, (2076), 15 states have internal predecessors, (2076), 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-26 08:23:02,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:23:02,209 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:23:02,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-26 08:23:02,419 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,SelfDestructingSolverStorable9 [2023-08-26 08:23:02,419 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-26 08:23:02,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:23:02,420 INFO L85 PathProgramCache]: Analyzing trace with hash -147232803, now seen corresponding path program 4 times [2023-08-26 08:23:02,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:23:02,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818734872] [2023-08-26 08:23:02,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:23:02,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:23:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:23:02,506 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:23:02,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:23:02,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818734872] [2023-08-26 08:23:02,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818734872] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:23:02,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740268460] [2023-08-26 08:23:02,507 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 08:23:02,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:23:02,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:23:02,507 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-26 08:23:02,509 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-26 08:23:03,519 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 08:23:03,519 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 08:23:03,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-26 08:23:03,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:23:41,569 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~n~0 4294967296)) (.cse0 (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296)) (.cse2 (div c_~x2~0 2))) (and (= (mod c_~x2~0 2) 0) (< 0 .cse0) (<= .cse1 (mod c_~x1~0 4294967296)) (< .cse0 .cse1) (< (mod .cse2 4294967296) .cse1) (= (mod c_~x1~0 2) 0) (= .cse0 (mod (div c_~x2~0 4) 4294967296)) (= (mod .cse2 2) 0))) is different from false [2023-08-26 08:24:28,263 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~n~0 4294967296)) (.cse1 (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296)) (.cse2 (div c_~x2~0 2))) (and (= (mod c_~x2~0 2) 0) (<= .cse0 (mod c_~x1~0 4294967296)) (< .cse1 .cse0) (< (mod .cse2 4294967296) .cse0) (= (mod c_~x1~0 2) 0) (= .cse1 (mod (div c_~x2~0 4) 4294967296)) (= (mod .cse2 2) 0))) is different from false [2023-08-26 08:24:44,387 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296)) (.cse5 (div c_~x2~0 2))) (let ((.cse1 (mod c_~x1~0 4294967296)) (.cse0 (+ (mod .cse5 4294967296) 1)) (.cse2 (+ .cse4 1)) (.cse3 (mod c_~x2~0 4294967296))) (and (= (mod c_~x2~0 2) 0) (<= .cse0 .cse1) (<= .cse2 .cse1) (<= .cse0 .cse3) (= (mod c_~x1~0 2) 0) (<= .cse2 .cse3) (= .cse4 (mod (div c_~x2~0 4) 4294967296)) (= (mod .cse5 2) 0)))) is different from false [2023-08-26 08:25:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-26 08:25:12,500 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:25:30,690 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:25:30,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740268460] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:25:30,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:25:30,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 17 [2023-08-26 08:25:30,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393104593] [2023-08-26 08:25:30,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:25:30,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-26 08:25:30,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:25:30,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-26 08:25:30,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=149, Unknown=15, NotChecked=84, Total=306 [2023-08-26 08:25:30,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-26 08:25:30,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 123 transitions, 1312 flow. Second operand has 18 states, 18 states have (on average 138.16666666666666) internal successors, (2487), 18 states have internal predecessors, (2487), 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-26 08:25:30,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:25:30,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-26 08:25:30,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:25:32,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:25:34,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:25:39,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:25:41,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:25:46,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:25:49,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:25:51,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:25:53,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:25:55,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 08:25:57,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 08:25:59,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:00,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:02,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:04,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:06,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:08,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:10,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:21,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:23,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:25,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:27,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:30,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:33,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:35,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:37,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:39,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:41,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:43,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:45,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:47,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:49,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:52,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:26:54,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:27:04,194 WARN L234 SmtUtils]: Spent 5.76s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 08:27:05,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:27:07,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 08:27:09,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 08:27:13,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:27:16,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:27:18,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:27:20,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:27:22,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:27:24,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:27:26,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:27:28,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:27:30,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:27:32,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:27:34,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:27:40,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:27:45,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:27:47,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:27:49,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:27:55,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 08:27:59,367 INFO L124 PetriNetUnfolderBase]: 878/1615 cut-off events. [2023-08-26 08:27:59,367 INFO L125 PetriNetUnfolderBase]: For 18143/18143 co-relation queries the response was YES. [2023-08-26 08:27:59,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8737 conditions, 1615 events. 878/1615 cut-off events. For 18143/18143 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 8008 event pairs, 61 based on Foata normal form. 16/1631 useless extension candidates. Maximal degree in co-relation 8699. Up to 472 conditions per place. [2023-08-26 08:27:59,378 INFO L140 encePairwiseOnDemand]: 338/344 looper letters, 171 selfloop transitions, 103 changer transitions 32/306 dead transitions. [2023-08-26 08:27:59,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 306 transitions, 3433 flow [2023-08-26 08:27:59,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-26 08:27:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-26 08:27:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3581 transitions. [2023-08-26 08:27:59,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4163953488372093 [2023-08-26 08:27:59,385 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3581 transitions. [2023-08-26 08:27:59,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3581 transitions. [2023-08-26 08:27:59,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:27:59,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3581 transitions. [2023-08-26 08:27:59,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 143.24) internal successors, (3581), 25 states have internal predecessors, (3581), 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-26 08:27:59,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 344.0) internal successors, (8944), 26 states have internal predecessors, (8944), 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-26 08:27:59,399 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 344.0) internal successors, (8944), 26 states have internal predecessors, (8944), 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-26 08:27:59,399 INFO L175 Difference]: Start difference. First operand has 102 places, 123 transitions, 1312 flow. Second operand 25 states and 3581 transitions. [2023-08-26 08:27:59,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 306 transitions, 3433 flow [2023-08-26 08:27:59,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 306 transitions, 2991 flow, removed 198 selfloop flow, removed 7 redundant places. [2023-08-26 08:27:59,432 INFO L231 Difference]: Finished difference. Result has 125 places, 161 transitions, 1899 flow [2023-08-26 08:27:59,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1899, PETRI_PLACES=125, PETRI_TRANSITIONS=161} [2023-08-26 08:27:59,433 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 85 predicate places. [2023-08-26 08:27:59,433 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 161 transitions, 1899 flow [2023-08-26 08:27:59,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 138.16666666666666) internal successors, (2487), 18 states have internal predecessors, (2487), 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-26 08:27:59,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:27:59,434 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:27:59,444 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-26 08:27:59,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:27:59,638 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-26 08:27:59,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:27:59,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2097007233, now seen corresponding path program 5 times [2023-08-26 08:27:59,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:27:59,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639083829] [2023-08-26 08:27:59,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:27:59,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:27:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:27:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:27:59,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:27:59,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639083829] [2023-08-26 08:27:59,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639083829] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:27:59,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084706442] [2023-08-26 08:27:59,720 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-26 08:27:59,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:27:59,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:27:59,721 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-26 08:27:59,722 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-26 08:29:06,925 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-26 08:29:06,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 08:29:06,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-26 08:29:06,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:29:40,319 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (* (div (* (- 1) c_~x2~0) 2) 4294967295) 4294967296)) (.cse0 (div c_~x1~0 2))) (let ((.cse4 (+ (mod .cse0 4294967296) 1)) (.cse3 (mod c_~x1~0 4294967296)) (.cse2 (+ .cse1 1)) (.cse5 (mod c_~x2~0 4294967296))) (and (= (mod .cse0 2) 0) (= (mod c_~x2~0 2) 0) (= .cse1 (mod (div c_~x1~0 4) 4294967296)) (<= .cse2 .cse3) (= (mod c_~x1~0 2) 0) (<= .cse4 .cse5) (<= .cse4 .cse3) (<= .cse2 .cse5)))) is different from false [2023-08-26 08:30:06,654 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (* (div (* (- 1) c_~x2~0) 2) 4294967295) 4294967296))) (let ((.cse3 (+ (mod (div c_~x1~0 2) 4294967296) 1)) (.cse2 (mod c_~x1~0 4294967296)) (.cse1 (+ .cse0 1)) (.cse4 (mod c_~x2~0 4294967296))) (and (= (mod c_~x2~0 2) 0) (= .cse0 (mod (div c_~x1~0 4) 4294967296)) (<= .cse1 .cse2) (= (mod c_~x1~0 2) 0) (<= .cse3 .cse4) (<= .cse3 .cse2) (<= .cse1 .cse4)))) is different from false [2023-08-26 08:30:53,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:30:53,043 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:31:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:31:23,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084706442] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:31:23,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:31:23,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 17 [2023-08-26 08:31:23,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182161105] [2023-08-26 08:31:23,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:31:23,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-26 08:31:23,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:31:23,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-26 08:31:23,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=159, Unknown=20, NotChecked=58, Total=306 [2023-08-26 08:31:23,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-26 08:31:23,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 161 transitions, 1899 flow. Second operand has 18 states, 18 states have (on average 138.16666666666666) internal successors, (2487), 18 states have internal predecessors, (2487), 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-26 08:31:23,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:31:23,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-26 08:31:23,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:31:26,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:31:27,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:31:29,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:31:31,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:33:06,989 WARN L234 SmtUtils]: Spent 1.51m on a formula simplification. DAG size of input: 62 DAG size of output: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 08:33:11,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:33:13,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:33:19,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:33:21,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:33:24,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:33:26,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:33:28,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-08-26 08:33:59,082 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-26 08:33:59,082 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-26 08:33:59,549 WARN L266 SmtUtils]: Removed 11 from assertion stack [2023-08-26 08:33:59,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 08:33:59,550 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONASSERT (32 of 33 remaining) [2023-08-26 08:33:59,561 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-26 08:33:59,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:33:59,751 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. [2023-08-26 08:33:59,756 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2023-08-26 08:33:59,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2023-08-26 08:33:59,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2023-08-26 08:33:59,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2023-08-26 08:33:59,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2023-08-26 08:33:59,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (26 of 33 remaining) [2023-08-26 08:33:59,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2023-08-26 08:33:59,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2023-08-26 08:33:59,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2023-08-26 08:33:59,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2023-08-26 08:33:59,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2023-08-26 08:33:59,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2023-08-26 08:33:59,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2023-08-26 08:33:59,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2023-08-26 08:33:59,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2023-08-26 08:33:59,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2023-08-26 08:33:59,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (15 of 33 remaining) [2023-08-26 08:33:59,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (14 of 33 remaining) [2023-08-26 08:33:59,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (13 of 33 remaining) [2023-08-26 08:33:59,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (12 of 33 remaining) [2023-08-26 08:33:59,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 33 remaining) [2023-08-26 08:33:59,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 33 remaining) [2023-08-26 08:33:59,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2023-08-26 08:33:59,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2023-08-26 08:33:59,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2023-08-26 08:33:59,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2023-08-26 08:33:59,759 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (5 of 33 remaining) [2023-08-26 08:33:59,759 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2023-08-26 08:33:59,759 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2023-08-26 08:33:59,759 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2023-08-26 08:33:59,759 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2023-08-26 08:33:59,759 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2023-08-26 08:33:59,759 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1] [2023-08-26 08:33:59,762 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 08:33:59,762 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 08:33:59,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 08:33:59 BasicIcfg [2023-08-26 08:33:59,764 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 08:33:59,764 INFO L158 Benchmark]: Toolchain (without parser) took 885117.39ms. Allocated memory was 415.2MB in the beginning and 650.1MB in the end (delta: 234.9MB). Free memory was 392.3MB in the beginning and 419.4MB in the end (delta: -27.1MB). Peak memory consumption was 208.2MB. Max. memory is 16.0GB. [2023-08-26 08:33:59,764 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 415.2MB. Free memory is still 392.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 08:33:59,764 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.92ms. Allocated memory is still 415.2MB. Free memory was 391.9MB in the beginning and 381.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-26 08:33:59,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.13ms. Allocated memory is still 415.2MB. Free memory was 381.0MB in the beginning and 379.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 08:33:59,765 INFO L158 Benchmark]: Boogie Preprocessor took 25.28ms. Allocated memory is still 415.2MB. Free memory was 379.2MB in the beginning and 377.6MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 08:33:59,765 INFO L158 Benchmark]: RCFGBuilder took 370.67ms. Allocated memory is still 415.2MB. Free memory was 377.6MB in the beginning and 361.3MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-08-26 08:33:59,765 INFO L158 Benchmark]: TraceAbstraction took 884494.37ms. Allocated memory was 415.2MB in the beginning and 650.1MB in the end (delta: 234.9MB). Free memory was 360.9MB in the beginning and 419.4MB in the end (delta: -58.5MB). Peak memory consumption was 176.7MB. Max. memory is 16.0GB. [2023-08-26 08:33:59,766 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.10ms. Allocated memory is still 415.2MB. Free memory is still 392.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 178.92ms. Allocated memory is still 415.2MB. Free memory was 391.9MB in the beginning and 381.0MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.13ms. Allocated memory is still 415.2MB. Free memory was 381.0MB in the beginning and 379.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 25.28ms. Allocated memory is still 415.2MB. Free memory was 379.2MB in the beginning and 377.6MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 370.67ms. Allocated memory is still 415.2MB. Free memory was 377.6MB in the beginning and 361.3MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 884494.37ms. Allocated memory was 415.2MB in the beginning and 650.1MB in the end (delta: 234.9MB). Free memory was 360.9MB in the beginning and 419.4MB in the end (delta: -58.5MB). Peak memory consumption was 176.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 148 PlacesBefore, 40 PlacesAfterwards, 148 TransitionsBefore, 37 TransitionsAfterwards, 2576 CoEnabledTransitionPairs, 8 FixpointIterations, 92 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 12 TrivialYvCompositions, 7 ConcurrentYvCompositions, 3 ChoiceCompositions, 185 TotalNumberOfCompositions, 4912 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3606, independent: 3487, independent conditional: 0, independent unconditional: 3487, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1556, independent: 1531, independent conditional: 0, independent unconditional: 1531, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3606, independent: 1956, independent conditional: 0, independent unconditional: 1956, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 1556, unknown conditional: 0, unknown unconditional: 1556] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, 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 PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 63 for 26505ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 199 locations, 33 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: 884.4s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 483.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 73 mSolverCounterUnknown, 460 SdHoareTripleChecker+Valid, 211.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 460 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 210.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 653 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2314 IncrementalHoareTripleChecker+Invalid, 3127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 0 mSDtfsCounter, 2314 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 175 SyntacticMatches, 15 SemanticMatches, 128 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 358.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1899occurred in iteration=11, InterpolantAutomatonStates: 107, 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.1s SsaConstructionTime, 73.8s SatisfiabilityAnalysisTime, 321.4s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 385 ConstructedInterpolants, 0 QuantifiedInterpolants, 12299 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1164 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 26 InterpolantComputations, 5 PerfectInterpolantSequences, 19/112 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