/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 04:32:42,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 04:32:42,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-25 04:32:42,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 04:32:42,446 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 04:32:42,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 04:32:42,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 04:32:42,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 04:32:42,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 04:32:42,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 04:32:42,491 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 04:32:42,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 04:32:42,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 04:32:42,492 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 04:32:42,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 04:32:42,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 04:32:42,493 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 04:32:42,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 04:32:42,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 04:32:42,494 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 04:32:42,494 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 04:32:42,498 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 04:32:42,498 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 04:32:42,499 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 04:32:42,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 04:32:42,499 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 04:32:42,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 04:32:42,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 04:32:42,500 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 04:32:42,500 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 04:32:42,501 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 04:32:42,501 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 04:32:42,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 04:32:42,501 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 04:32:42,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 04:32:42,502 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 04:32:42,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 04:32:42,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 04:32:42,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 04:32:42,847 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 04:32:42,847 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 04:32:42,848 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-25 04:32:44,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 04:32:44,277 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 04:32:44,277 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-08-25 04:32:44,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5062e3b9/dfd72d87a1654b9489c1d5c73d95b37e/FLAG0c2178d83 [2023-08-25 04:32:44,294 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5062e3b9/dfd72d87a1654b9489c1d5c73d95b37e [2023-08-25 04:32:44,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 04:32:44,297 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 04:32:44,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 04:32:44,298 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 04:32:44,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 04:32:44,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 04:32:44" (1/1) ... [2023-08-25 04:32:44,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b32300f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:32:44, skipping insertion in model container [2023-08-25 04:32:44,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 04:32:44" (1/1) ... [2023-08-25 04:32:44,318 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 04:32:44,435 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 04:32:44,445 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 04:32:44,479 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 04:32:44,491 INFO L206 MainTranslator]: Completed translation [2023-08-25 04:32:44,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:32:44 WrapperNode [2023-08-25 04:32:44,492 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 04:32:44,493 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 04:32:44,493 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 04:32:44,493 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 04:32:44,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:32:44" (1/1) ... [2023-08-25 04:32:44,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:32:44" (1/1) ... [2023-08-25 04:32:44,546 INFO L138 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 98 [2023-08-25 04:32:44,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 04:32:44,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 04:32:44,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 04:32:44,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 04:32:44,555 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:32:44" (1/1) ... [2023-08-25 04:32:44,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:32:44" (1/1) ... [2023-08-25 04:32:44,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:32:44" (1/1) ... [2023-08-25 04:32:44,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:32:44" (1/1) ... [2023-08-25 04:32:44,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:32:44" (1/1) ... [2023-08-25 04:32:44,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:32:44" (1/1) ... [2023-08-25 04:32:44,578 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:32:44" (1/1) ... [2023-08-25 04:32:44,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:32:44" (1/1) ... [2023-08-25 04:32:44,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 04:32:44,586 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 04:32:44,586 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 04:32:44,586 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 04:32:44,587 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:32:44" (1/1) ... [2023-08-25 04:32:44,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 04:32:44,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:32:44,618 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-25 04:32:44,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-25 04:32:44,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 04:32:44,654 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 04:32:44,654 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 04:32:44,654 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 04:32:44,654 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 04:32:44,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 04:32:44,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 04:32:44,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 04:32:44,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 04:32:44,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 04:32:44,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 04:32:44,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 04:32:44,657 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 04:32:44,768 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 04:32:44,771 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 04:32:45,000 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 04:32:45,008 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 04:32:45,008 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-25 04:32:45,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 04:32:45 BoogieIcfgContainer [2023-08-25 04:32:45,010 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 04:32:45,012 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 04:32:45,012 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 04:32:45,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 04:32:45,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 04:32:44" (1/3) ... [2023-08-25 04:32:45,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43449675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 04:32:45, skipping insertion in model container [2023-08-25 04:32:45,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:32:44" (2/3) ... [2023-08-25 04:32:45,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43449675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 04:32:45, skipping insertion in model container [2023-08-25 04:32:45,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 04:32:45" (3/3) ... [2023-08-25 04:32:45,017 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2023-08-25 04:32:45,029 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 04:32:45,030 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2023-08-25 04:32:45,030 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 04:32:45,110 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-25 04:32:45,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 159 transitions, 334 flow [2023-08-25 04:32:45,193 INFO L124 PetriNetUnfolderBase]: 7/157 cut-off events. [2023-08-25 04:32:45,194 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 04:32:45,203 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-25 04:32:45,203 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 159 transitions, 334 flow [2023-08-25 04:32:45,213 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 148 transitions, 308 flow [2023-08-25 04:32:45,216 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 04:32:45,232 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 148 transitions, 308 flow [2023-08-25 04:32:45,239 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 148 transitions, 308 flow [2023-08-25 04:32:45,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 148 transitions, 308 flow [2023-08-25 04:32:45,299 INFO L124 PetriNetUnfolderBase]: 7/148 cut-off events. [2023-08-25 04:32:45,299 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 04:32:45,301 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-25 04:32:45,304 INFO L119 LiptonReduction]: Number of co-enabled transitions 2576 [2023-08-25 04:32:49,262 INFO L134 LiptonReduction]: Checked pairs total: 4912 [2023-08-25 04:32:49,263 INFO L136 LiptonReduction]: Total number of compositions: 185 [2023-08-25 04:32:49,275 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 04:32:49,280 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;@44564f39, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 04:32:49,280 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2023-08-25 04:32:49,281 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 04:32:49,282 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 04:32:49,282 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 04:32:49,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:32:49,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 04:32:49,283 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-25 04:32:49,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:32:49,287 INFO L85 PathProgramCache]: Analyzing trace with hash 605, now seen corresponding path program 1 times [2023-08-25 04:32:49,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:32:49,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820679256] [2023-08-25 04:32:49,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:32:49,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:32:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:32:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:32:49,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:32:49,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820679256] [2023-08-25 04:32:49,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820679256] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:32:49,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:32:49,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 04:32:49,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907096103] [2023-08-25 04:32:49,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:32:49,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 04:32:49,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:32:49,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 04:32:49,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 04:32:49,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 344 [2023-08-25 04:32:49,409 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-25 04:32:49,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:32:49,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 344 [2023-08-25 04:32:49,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:32:49,470 INFO L124 PetriNetUnfolderBase]: 40/81 cut-off events. [2023-08-25 04:32:49,471 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-08-25 04:32:49,471 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-25 04:32:49,473 INFO L140 encePairwiseOnDemand]: 324/344 looper letters, 15 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2023-08-25 04:32:49,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 17 transitions, 76 flow [2023-08-25 04:32:49,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 04:32:49,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 04:32:49,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 335 transitions. [2023-08-25 04:32:49,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48691860465116277 [2023-08-25 04:32:49,486 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 335 transitions. [2023-08-25 04:32:49,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 335 transitions. [2023-08-25 04:32:49,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:32:49,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 335 transitions. [2023-08-25 04:32:49,491 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-25 04:32:49,495 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-25 04:32:49,496 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-25 04:32:49,497 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 86 flow. Second operand 2 states and 335 transitions. [2023-08-25 04:32:49,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 17 transitions, 76 flow [2023-08-25 04:32:49,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 17 transitions, 68 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 04:32:49,501 INFO L231 Difference]: Finished difference. Result has 19 places, 17 transitions, 38 flow [2023-08-25 04:32:49,502 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-25 04:32:49,505 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -21 predicate places. [2023-08-25 04:32:49,505 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 38 flow [2023-08-25 04:32:49,505 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-25 04:32:49,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:32:49,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-25 04:32:49,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 04:32:49,506 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-25 04:32:49,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:32:49,507 INFO L85 PathProgramCache]: Analyzing trace with hash 18624315, now seen corresponding path program 1 times [2023-08-25 04:32:49,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:32:49,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901704609] [2023-08-25 04:32:49,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:32:49,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:32:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:32:49,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:32:49,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:32:49,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901704609] [2023-08-25 04:32:49,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901704609] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:32:49,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:32:49,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 04:32:49,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63967440] [2023-08-25 04:32:49,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:32:49,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 04:32:49,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:32:49,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 04:32:49,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 04:32:49,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 344 [2023-08-25 04:32:49,577 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-25 04:32:49,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:32:49,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 344 [2023-08-25 04:32:49,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:32:49,616 INFO L124 PetriNetUnfolderBase]: 45/82 cut-off events. [2023-08-25 04:32:49,616 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 04:32:49,616 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-25 04:32:49,617 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 18 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2023-08-25 04:32:49,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 20 transitions, 85 flow [2023-08-25 04:32:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 04:32:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 04:32:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-08-25 04:32:49,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4312015503875969 [2023-08-25 04:32:49,620 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-08-25 04:32:49,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-08-25 04:32:49,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:32:49,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-08-25 04:32:49,622 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-25 04:32:49,625 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-25 04:32:49,625 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-25 04:32:49,625 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 38 flow. Second operand 3 states and 445 transitions. [2023-08-25 04:32:49,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 20 transitions, 85 flow [2023-08-25 04:32:49,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 20 transitions, 85 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 04:32:49,626 INFO L231 Difference]: Finished difference. Result has 20 places, 17 transitions, 48 flow [2023-08-25 04:32:49,627 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-25 04:32:49,627 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -20 predicate places. [2023-08-25 04:32:49,627 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 48 flow [2023-08-25 04:32:49,628 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-25 04:32:49,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:32:49,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:32:49,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 04:32:49,628 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-25 04:32:49,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:32:49,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1689284570, now seen corresponding path program 1 times [2023-08-25 04:32:49,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:32:49,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314060950] [2023-08-25 04:32:49,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:32:49,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:32:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:32:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:32:49,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:32:49,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314060950] [2023-08-25 04:32:49,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314060950] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:32:49,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:32:49,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 04:32:49,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019832869] [2023-08-25 04:32:49,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:32:49,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 04:32:49,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:32:49,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 04:32:49,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 04:32:49,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 344 [2023-08-25 04:32:49,869 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-25 04:32:49,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:32:49,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 344 [2023-08-25 04:32:49,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:32:49,919 INFO L124 PetriNetUnfolderBase]: 79/143 cut-off events. [2023-08-25 04:32:49,920 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-25 04:32:49,920 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-25 04:32:49,921 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 25 selfloop transitions, 3 changer transitions 1/29 dead transitions. [2023-08-25 04:32:49,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 29 transitions, 137 flow [2023-08-25 04:32:49,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 04:32:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 04:32:49,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-08-25 04:32:49,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4253875968992248 [2023-08-25 04:32:49,924 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-08-25 04:32:49,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-08-25 04:32:49,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:32:49,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-08-25 04:32:49,925 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-25 04:32:49,928 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-25 04:32:49,928 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-25 04:32:49,928 INFO L175 Difference]: Start difference. First operand has 20 places, 17 transitions, 48 flow. Second operand 3 states and 439 transitions. [2023-08-25 04:32:49,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 29 transitions, 137 flow [2023-08-25 04:32:49,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 29 transitions, 137 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 04:32:49,930 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 67 flow [2023-08-25 04:32:49,930 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-25 04:32:49,930 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -17 predicate places. [2023-08-25 04:32:49,931 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 67 flow [2023-08-25 04:32:49,931 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-25 04:32:49,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:32:49,931 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:32:49,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 04:32:49,932 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-25 04:32:49,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:32:49,932 INFO L85 PathProgramCache]: Analyzing trace with hash 147101233, now seen corresponding path program 1 times [2023-08-25 04:32:49,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:32:49,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586054280] [2023-08-25 04:32:49,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:32:49,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:32:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:32:50,057 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-25 04:32:50,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:32:50,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586054280] [2023-08-25 04:32:50,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586054280] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:32:50,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:32:50,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 04:32:50,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503622881] [2023-08-25 04:32:50,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:32:50,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 04:32:50,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:32:50,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 04:32:50,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 04:32:50,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-25 04:32:50,061 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-25 04:32:50,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:32:50,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-25 04:32:50,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:32:50,151 INFO L124 PetriNetUnfolderBase]: 77/141 cut-off events. [2023-08-25 04:32:50,151 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-08-25 04:32:50,152 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-25 04:32:50,153 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 32 selfloop transitions, 6 changer transitions 5/43 dead transitions. [2023-08-25 04:32:50,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 43 transitions, 221 flow [2023-08-25 04:32:50,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 04:32:50,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 04:32:50,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 717 transitions. [2023-08-25 04:32:50,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41686046511627906 [2023-08-25 04:32:50,156 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 717 transitions. [2023-08-25 04:32:50,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 717 transitions. [2023-08-25 04:32:50,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:32:50,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 717 transitions. [2023-08-25 04:32:50,158 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-25 04:32:50,161 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-25 04:32:50,162 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-25 04:32:50,162 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 67 flow. Second operand 5 states and 717 transitions. [2023-08-25 04:32:50,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 43 transitions, 221 flow [2023-08-25 04:32:50,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 43 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 04:32:50,163 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 88 flow [2023-08-25 04:32:50,164 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-25 04:32:50,164 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -13 predicate places. [2023-08-25 04:32:50,164 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 88 flow [2023-08-25 04:32:50,165 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-25 04:32:50,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:32:50,165 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:32:50,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 04:32:50,165 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-25 04:32:50,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:32:50,166 INFO L85 PathProgramCache]: Analyzing trace with hash 494047363, now seen corresponding path program 1 times [2023-08-25 04:32:50,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:32:50,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99854533] [2023-08-25 04:32:50,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:32:50,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:32:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:32:50,224 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-25 04:32:50,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:32:50,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99854533] [2023-08-25 04:32:50,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99854533] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:32:50,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:32:50,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 04:32:50,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110091204] [2023-08-25 04:32:50,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:32:50,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 04:32:50,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:32:50,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 04:32:50,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 04:32:50,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-25 04:32:50,227 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-25 04:32:50,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:32:50,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-25 04:32:50,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:32:50,303 INFO L124 PetriNetUnfolderBase]: 67/127 cut-off events. [2023-08-25 04:32:50,304 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-08-25 04:32:50,304 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-25 04:32:50,305 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 26 selfloop transitions, 4 changer transitions 9/39 dead transitions. [2023-08-25 04:32:50,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 39 transitions, 217 flow [2023-08-25 04:32:50,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 04:32:50,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 04:32:50,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 713 transitions. [2023-08-25 04:32:50,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4145348837209302 [2023-08-25 04:32:50,308 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 713 transitions. [2023-08-25 04:32:50,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 713 transitions. [2023-08-25 04:32:50,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:32:50,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 713 transitions. [2023-08-25 04:32:50,310 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-25 04:32:50,313 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-25 04:32:50,314 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-25 04:32:50,314 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 88 flow. Second operand 5 states and 713 transitions. [2023-08-25 04:32:50,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 39 transitions, 217 flow [2023-08-25 04:32:50,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 39 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 04:32:50,315 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 82 flow [2023-08-25 04:32:50,316 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-25 04:32:50,316 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -10 predicate places. [2023-08-25 04:32:50,316 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 82 flow [2023-08-25 04:32:50,317 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-25 04:32:50,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:32:50,317 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:32:50,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 04:32:50,317 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-25 04:32:50,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:32:50,318 INFO L85 PathProgramCache]: Analyzing trace with hash 567858883, now seen corresponding path program 2 times [2023-08-25 04:32:50,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:32:50,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007788341] [2023-08-25 04:32:50,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:32:50,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:32:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:32:50,379 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-25 04:32:50,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:32:50,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007788341] [2023-08-25 04:32:50,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007788341] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 04:32:50,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124117529] [2023-08-25 04:32:50,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 04:32:50,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:32:50,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:32:50,385 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 04:32:50,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-25 04:32:50,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 04:32:50,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 04:32:50,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 04:32:50,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 04:32:50,611 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-25 04:32:50,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 04:32:50,685 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-25 04:32:50,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124117529] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 04:32:50,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 04:32:50,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-25 04:32:50,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636663233] [2023-08-25 04:32:50,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 04:32:50,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 04:32:50,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:32:50,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 04:32:50,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 04:32:50,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-25 04:32:50,693 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-25 04:32:50,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:32:50,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-25 04:32:50,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:32:50,781 INFO L124 PetriNetUnfolderBase]: 78/139 cut-off events. [2023-08-25 04:32:50,782 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-08-25 04:32:50,782 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-25 04:32:50,783 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 31 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2023-08-25 04:32:50,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 213 flow [2023-08-25 04:32:50,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 04:32:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 04:32:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2023-08-25 04:32:50,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.413953488372093 [2023-08-25 04:32:50,786 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2023-08-25 04:32:50,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2023-08-25 04:32:50,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:32:50,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2023-08-25 04:32:50,788 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-25 04:32:50,790 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-25 04:32:50,790 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-25 04:32:50,791 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 82 flow. Second operand 5 states and 712 transitions. [2023-08-25 04:32:50,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 213 flow [2023-08-25 04:32:50,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 37 transitions, 203 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-25 04:32:50,793 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 109 flow [2023-08-25 04:32:50,793 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-25 04:32:50,793 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-08-25 04:32:50,794 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 109 flow [2023-08-25 04:32:50,794 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-25 04:32:50,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:32:50,794 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:32:50,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-25 04:32:51,002 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-25 04:32:51,003 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-25 04:32:51,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:32:51,003 INFO L85 PathProgramCache]: Analyzing trace with hash 73483995, now seen corresponding path program 2 times [2023-08-25 04:32:51,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:32:51,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530016787] [2023-08-25 04:32:51,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:32:51,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:32:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:32:51,055 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-25 04:32:51,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:32:51,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530016787] [2023-08-25 04:32:51,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530016787] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 04:32:51,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98102007] [2023-08-25 04:32:51,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 04:32:51,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:32:51,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:32:51,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 04:32:51,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-25 04:32:51,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 04:32:51,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 04:32:51,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 04:32:51,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 04:32:51,198 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-25 04:32:51,198 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 04:32:51,252 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-25 04:32:51,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98102007] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 04:32:51,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 04:32:51,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-25 04:32:51,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034691415] [2023-08-25 04:32:51,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 04:32:51,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 04:32:51,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:32:51,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 04:32:51,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 04:32:51,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-25 04:32:51,255 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-25 04:32:51,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:32:51,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-25 04:32:51,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:32:51,346 INFO L124 PetriNetUnfolderBase]: 96/169 cut-off events. [2023-08-25 04:32:51,346 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2023-08-25 04:32:51,347 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-25 04:32:51,348 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 30 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2023-08-25 04:32:51,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 234 flow [2023-08-25 04:32:51,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 04:32:51,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 04:32:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2023-08-25 04:32:51,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4116279069767442 [2023-08-25 04:32:51,351 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 708 transitions. [2023-08-25 04:32:51,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 708 transitions. [2023-08-25 04:32:51,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:32:51,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 708 transitions. [2023-08-25 04:32:51,353 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-25 04:32:51,356 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-25 04:32:51,356 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-25 04:32:51,356 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 109 flow. Second operand 5 states and 708 transitions. [2023-08-25 04:32:51,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 234 flow [2023-08-25 04:32:51,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 229 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-25 04:32:51,360 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 145 flow [2023-08-25 04:32:51,360 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-25 04:32:51,361 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-08-25 04:32:51,361 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 145 flow [2023-08-25 04:32:51,361 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-25 04:32:51,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:32:51,362 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:32:51,372 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-25 04:32:51,570 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-25 04:32:51,570 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-25 04:32:51,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:32:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash 335338564, now seen corresponding path program 1 times [2023-08-25 04:32:51,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:32:51,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270618598] [2023-08-25 04:32:51,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:32:51,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:32:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:32:51,975 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-25 04:32:51,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:32:51,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270618598] [2023-08-25 04:32:51,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270618598] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 04:32:51,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052099720] [2023-08-25 04:32:51,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:32:51,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:32:51,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:32:51,978 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 04:32:52,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-25 04:32:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:32:52,129 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-25 04:32:52,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 04:33:00,229 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-25 04:33:00,229 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 04:33:03,129 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-25 04:33:03,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052099720] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 04:33:03,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 04:33:03,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-25 04:33:03,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490108591] [2023-08-25 04:33:03,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 04:33:03,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-25 04:33:03,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:33:03,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-25 04:33:03,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-08-25 04:33:03,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-25 04:33:03,134 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-25 04:33:03,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:33:03,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-25 04:33:03,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:33:06,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:33:08,866 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-25 04:33:10,914 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-25 04:33:13,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 04:33:15,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:33:16,134 INFO L124 PetriNetUnfolderBase]: 312/560 cut-off events. [2023-08-25 04:33:16,134 INFO L125 PetriNetUnfolderBase]: For 1028/1028 co-relation queries the response was YES. [2023-08-25 04:33:16,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2058 conditions, 560 events. 312/560 cut-off events. For 1028/1028 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2242 event pairs, 21 based on Foata normal form. 7/567 useless extension candidates. Maximal degree in co-relation 2045. Up to 146 conditions per place. [2023-08-25 04:33:16,139 INFO L140 encePairwiseOnDemand]: 338/344 looper letters, 75 selfloop transitions, 25 changer transitions 19/119 dead transitions. [2023-08-25 04:33:16,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 119 transitions, 815 flow [2023-08-25 04:33:16,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-25 04:33:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-25 04:33:16,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1867 transitions. [2023-08-25 04:33:16,145 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4174865831842576 [2023-08-25 04:33:16,145 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1867 transitions. [2023-08-25 04:33:16,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1867 transitions. [2023-08-25 04:33:16,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:33:16,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1867 transitions. [2023-08-25 04:33:16,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 143.6153846153846) internal successors, (1867), 13 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:33:16,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 344.0) internal successors, (4816), 14 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:33:16,157 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 344.0) internal successors, (4816), 14 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:33:16,157 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 145 flow. Second operand 13 states and 1867 transitions. [2023-08-25 04:33:16,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 119 transitions, 815 flow [2023-08-25 04:33:16,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 119 transitions, 800 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-25 04:33:16,162 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 397 flow [2023-08-25 04:33:16,162 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=13, PETRI_FLOW=397, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-08-25 04:33:16,163 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2023-08-25 04:33:16,163 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 397 flow [2023-08-25 04:33:16,164 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-25 04:33:16,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:33:16,164 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:33:16,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-25 04:33:16,377 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-25 04:33:16,377 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-25 04:33:16,377 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:33:16,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1718693540, now seen corresponding path program 2 times [2023-08-25 04:33:16,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:33:16,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920173193] [2023-08-25 04:33:16,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:33:16,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:33:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:33:16,787 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-25 04:33:16,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:33:16,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920173193] [2023-08-25 04:33:16,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920173193] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 04:33:16,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983779050] [2023-08-25 04:33:16,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 04:33:16,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:33:16,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:33:16,789 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 04:33:16,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-25 04:33:16,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 04:33:16,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 04:33:16,913 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-25 04:33:16,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 04:33:23,081 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-25 04:33:23,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 04:33:28,737 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-25 04:33:28,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983779050] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 04:33:28,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 04:33:28,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-25 04:33:28,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125223485] [2023-08-25 04:33:28,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 04:33:28,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-25 04:33:28,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:33:28,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-25 04:33:28,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=139, Unknown=3, NotChecked=0, Total=210 [2023-08-25 04:33:28,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-25 04:33:28,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 397 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-25 04:33:28,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:33:28,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-25 04:33:28,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:33:31,910 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-25 04:33:34,015 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-25 04:33:36,412 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-25 04:33:46,971 WARN L234 SmtUtils]: Spent 6.83s on a formula simplification. DAG size of input: 69 DAG size of output: 25 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 04:33:51,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 04:33:55,923 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-25 04:33:58,783 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-25 04:34:01,461 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-25 04:34:03,539 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-25 04:34:05,673 INFO L124 PetriNetUnfolderBase]: 522/933 cut-off events. [2023-08-25 04:34:05,673 INFO L125 PetriNetUnfolderBase]: For 4306/4306 co-relation queries the response was YES. [2023-08-25 04:34:05,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4163 conditions, 933 events. 522/933 cut-off events. For 4306/4306 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4217 event pairs, 53 based on Foata normal form. 9/942 useless extension candidates. Maximal degree in co-relation 4142. Up to 453 conditions per place. [2023-08-25 04:34:05,681 INFO L140 encePairwiseOnDemand]: 335/344 looper letters, 96 selfloop transitions, 38 changer transitions 14/148 dead transitions. [2023-08-25 04:34:05,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 148 transitions, 1314 flow [2023-08-25 04:34:05,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-25 04:34:05,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-25 04:34:05,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2145 transitions. [2023-08-25 04:34:05,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41569767441860467 [2023-08-25 04:34:05,688 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2145 transitions. [2023-08-25 04:34:05,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2145 transitions. [2023-08-25 04:34:05,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:34:05,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2145 transitions. [2023-08-25 04:34:05,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 143.0) internal successors, (2145), 15 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:34:05,700 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-25 04:34:05,701 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-25 04:34:05,701 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 397 flow. Second operand 15 states and 2145 transitions. [2023-08-25 04:34:05,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 148 transitions, 1314 flow [2023-08-25 04:34:05,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 148 transitions, 1211 flow, removed 50 selfloop flow, removed 2 redundant places. [2023-08-25 04:34:05,712 INFO L231 Difference]: Finished difference. Result has 74 places, 77 transitions, 739 flow [2023-08-25 04:34:05,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=739, PETRI_PLACES=74, PETRI_TRANSITIONS=77} [2023-08-25 04:34:05,713 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2023-08-25 04:34:05,713 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 77 transitions, 739 flow [2023-08-25 04:34:05,714 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-25 04:34:05,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:34:05,714 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:34:05,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-25 04:34:05,920 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-25 04:34:05,920 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-25 04:34:05,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:34:05,921 INFO L85 PathProgramCache]: Analyzing trace with hash 29739985, now seen corresponding path program 3 times [2023-08-25 04:34:05,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:34:05,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748344023] [2023-08-25 04:34:05,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:34:05,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:34:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:34:06,049 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-25 04:34:06,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:34:06,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748344023] [2023-08-25 04:34:06,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748344023] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 04:34:06,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477834953] [2023-08-25 04:34:06,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 04:34:06,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:34:06,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:34:06,050 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 04:34:06,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-25 04:34:11,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-25 04:34:11,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 04:34:11,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-25 04:34:11,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 04:34:25,099 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-25 04:34:25,099 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 04:34:32,593 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-25 04:34:32,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477834953] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 04:34:32,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 04:34:32,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 14 [2023-08-25 04:34:32,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074482903] [2023-08-25 04:34:32,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 04:34:32,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-25 04:34:32,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:34:32,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-25 04:34:32,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=144, Unknown=3, NotChecked=0, Total=210 [2023-08-25 04:34:32,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-25 04:34:32,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 77 transitions, 739 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-25 04:34:32,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:34:32,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-25 04:34:32,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:34:36,916 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-25 04:34:44,379 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-25 04:34:46,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:34:51,527 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-25 04:34:53,993 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-25 04:35:11,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:35: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-25 04:35:15,076 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-25 04:35:16,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:35:18,797 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-25 04:35:20,881 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-25 04:35:22,896 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-25 04:35:25,526 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-25 04:35:27,785 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-25 04:35:39,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-25 04:35:46,061 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-25 04:35:50,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:35:58,345 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-25 04:35:58,387 INFO L124 PetriNetUnfolderBase]: 850/1513 cut-off events. [2023-08-25 04:35:58,387 INFO L125 PetriNetUnfolderBase]: For 11023/11023 co-relation queries the response was YES. [2023-08-25 04:35:58,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8004 conditions, 1513 events. 850/1513 cut-off events. For 11023/11023 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7361 event pairs, 61 based on Foata normal form. 30/1543 useless extension candidates. Maximal degree in co-relation 7974. Up to 448 conditions per place. [2023-08-25 04:35:58,397 INFO L140 encePairwiseOnDemand]: 337/344 looper letters, 131 selfloop transitions, 86 changer transitions 45/262 dead transitions. [2023-08-25 04:35:58,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 262 transitions, 2893 flow [2023-08-25 04:35:58,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-25 04:35:58,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-25 04:35:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3543 transitions. [2023-08-25 04:35:58,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4119767441860465 [2023-08-25 04:35:58,407 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3543 transitions. [2023-08-25 04:35:58,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3543 transitions. [2023-08-25 04:35:58,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:35:58,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3543 transitions. [2023-08-25 04:35:58,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 141.72) internal successors, (3543), 25 states have internal predecessors, (3543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:35:58,425 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-25 04:35:58,426 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-25 04:35:58,426 INFO L175 Difference]: Start difference. First operand has 74 places, 77 transitions, 739 flow. Second operand 25 states and 3543 transitions. [2023-08-25 04:35:58,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 262 transitions, 2893 flow [2023-08-25 04:35:58,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 262 transitions, 2646 flow, removed 119 selfloop flow, removed 4 redundant places. [2023-08-25 04:35:58,454 INFO L231 Difference]: Finished difference. Result has 105 places, 138 transitions, 1434 flow [2023-08-25 04:35:58,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1434, PETRI_PLACES=105, PETRI_TRANSITIONS=138} [2023-08-25 04:35:58,454 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 65 predicate places. [2023-08-25 04:35:58,454 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 138 transitions, 1434 flow [2023-08-25 04:35:58,455 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-25 04:35:58,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:35:58,456 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:35:58,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-25 04:35:58,661 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-25 04:35:58,662 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-25 04:35:58,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:35:58,662 INFO L85 PathProgramCache]: Analyzing trace with hash -147232803, now seen corresponding path program 4 times [2023-08-25 04:35:58,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:35:58,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897073233] [2023-08-25 04:35:58,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:35:58,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:35:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:35:58,791 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-25 04:35:58,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:35:58,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897073233] [2023-08-25 04:35:58,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897073233] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 04:35:58,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384790175] [2023-08-25 04:35:58,791 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-25 04:35:58,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:35:58,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:35:58,793 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 04:35:58,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-25 04:35:59,820 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-25 04:35:59,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 04:35:59,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-25 04:35:59,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 04:36:25,516 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 (<= .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-25 04:37:15,769 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 (<= .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-25 04:37:32,154 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-25 04:37:32,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 04:37:41,063 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-25 04:37:41,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384790175] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 04:37:41,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 04:37:41,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 16 [2023-08-25 04:37:41,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758250172] [2023-08-25 04:37:41,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 04:37:41,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-25 04:37:41,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:37:41,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-25 04:37:41,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=8, NotChecked=54, Total=272 [2023-08-25 04:37:41,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-25 04:37:41,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 138 transitions, 1434 flow. Second operand has 17 states, 17 states have (on average 138.2941176470588) internal successors, (2351), 17 states have internal predecessors, (2351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:37:41,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:37:41,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-25 04:37:41,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:37:43,315 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-25 04:37:45,330 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-25 04:37:49,568 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-25 04:37:52,562 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-25 04:37:55,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-25 04:37:56,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:37:58,596 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-25 04:38:00,699 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-25 04:38:03,012 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-25 04:38:05,022 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-25 04:38:07,061 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-25 04:38:18,469 WARN L234 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 04:38:20,622 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-25 04:38:22,686 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-25 04:38:25,252 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-25 04:38:27,891 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-25 04:38:29,971 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-25 04:38:31,977 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-25 04:38:34,122 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-25 04:38:36,130 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-25 04:38:38,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-25 04:38:40,218 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-25 04:38:42,221 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-25 04:38:44,228 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-25 04:38:48,968 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-25 04:38:51,665 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-25 04:38:53,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:39:03,100 WARN L234 SmtUtils]: Spent 6.95s 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-25 04:39:05,119 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-25 04:39:07,170 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-25 04:39:09,687 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-25 04:39:11,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:39:14,202 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-25 04:39:17,172 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-25 04:39:19,188 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-25 04:39:22,028 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-25 04:39:24,033 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-25 04:39:26,043 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-25 04:39:28,050 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-25 04:39:30,094 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-25 04:39:32,098 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-25 04:39:34,103 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-25 04:39:41,913 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-25 04:39:44,525 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-25 04:39:54,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:39:56,326 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-25 04:39:58,345 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-25 04:40:00,349 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-25 04:40:02,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:40:09,226 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-25 04:40:10,275 INFO L124 PetriNetUnfolderBase]: 1136/2079 cut-off events. [2023-08-25 04:40:10,276 INFO L125 PetriNetUnfolderBase]: For 19932/19932 co-relation queries the response was YES. [2023-08-25 04:40:10,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11770 conditions, 2079 events. 1136/2079 cut-off events. For 19932/19932 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 10545 event pairs, 85 based on Foata normal form. 19/2098 useless extension candidates. Maximal degree in co-relation 11729. Up to 624 conditions per place. [2023-08-25 04:40:10,293 INFO L140 encePairwiseOnDemand]: 338/344 looper letters, 183 selfloop transitions, 132 changer transitions 42/357 dead transitions. [2023-08-25 04:40:10,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 357 transitions, 4077 flow [2023-08-25 04:40:10,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-25 04:40:10,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-25 04:40:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3720 transitions. [2023-08-25 04:40:10,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4159212880143113 [2023-08-25 04:40:10,302 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 3720 transitions. [2023-08-25 04:40:10,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 3720 transitions. [2023-08-25 04:40:10,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:40:10,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 3720 transitions. [2023-08-25 04:40:10,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 143.07692307692307) internal successors, (3720), 26 states have internal predecessors, (3720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:40:10,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 344.0) internal successors, (9288), 27 states have internal predecessors, (9288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:40:10,321 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 344.0) internal successors, (9288), 27 states have internal predecessors, (9288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:40:10,321 INFO L175 Difference]: Start difference. First operand has 105 places, 138 transitions, 1434 flow. Second operand 26 states and 3720 transitions. [2023-08-25 04:40:10,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 357 transitions, 4077 flow [2023-08-25 04:40:10,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 357 transitions, 3706 flow, removed 157 selfloop flow, removed 8 redundant places. [2023-08-25 04:40:10,383 INFO L231 Difference]: Finished difference. Result has 131 places, 199 transitions, 2442 flow [2023-08-25 04:40:10,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=1199, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2442, PETRI_PLACES=131, PETRI_TRANSITIONS=199} [2023-08-25 04:40:10,384 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 91 predicate places. [2023-08-25 04:40:10,384 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 199 transitions, 2442 flow [2023-08-25 04:40:10,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 138.2941176470588) internal successors, (2351), 17 states have internal predecessors, (2351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:40:10,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:40:10,385 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:40:10,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-25 04:40:10,593 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-25 04:40:10,594 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-25 04:40:10,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:40:10,594 INFO L85 PathProgramCache]: Analyzing trace with hash 641183603, now seen corresponding path program 5 times [2023-08-25 04:40:10,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:40:10,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847755923] [2023-08-25 04:40:10,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:40:10,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:40:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:40:10,726 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-25 04:40:10,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:40:10,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847755923] [2023-08-25 04:40:10,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847755923] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 04:40:10,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214732064] [2023-08-25 04:40:10,729 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-25 04:40:10,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:40:10,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:40:10,733 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 04:40:10,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-25 04:40:13,202 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-25 04:40:13,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 04:40:13,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-25 04:40:13,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 04:40:41,179 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (div c_~x2~0 2))) (let ((.cse1 (mod c_~n~0 4294967296)) (.cse0 (mod (* 4294967295 (div (* (- 1) .cse2) 2)) 4294967296))) (and (< .cse0 .cse1) (= (mod c_~x2~0 2) 0) (<= .cse1 (mod c_~x1~0 4294967296)) (< (mod .cse2 4294967296) .cse1) (= (mod c_~x1~0 2) 0) (= .cse0 (mod (div c_~x1~0 2) 4294967296)) (= (mod .cse2 2) 0)))) is different from false [2023-08-25 04:41:05,243 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (div c_~x2~0 2))) (let ((.cse4 (mod (* 4294967295 (div (* (- 1) .cse5) 2)) 4294967296))) (let ((.cse2 (+ (mod .cse5 4294967296) 1)) (.cse1 (mod c_~x2~0 4294967296)) (.cse0 (+ .cse4 1)) (.cse3 (mod c_~x1~0 4294967296))) (and (<= .cse0 .cse1) (<= .cse2 .cse3) (<= .cse2 .cse1) (= (mod c_~x1~0 2) 0) (<= .cse0 .cse3) (= .cse4 (mod (div c_~x1~0 2) 4294967296)) (= (mod .cse5 2) 0))))) is different from false [2023-08-25 04:41:13,394 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-25 04:41:13,394 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 04:41:24,272 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-25 04:41:24,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214732064] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 04:41:24,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 04:41:24,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 16 [2023-08-25 04:41:24,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984250907] [2023-08-25 04:41:24,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 04:41:24,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-25 04:41:24,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:41:24,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-25 04:41:24,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=151, Unknown=10, NotChecked=54, Total=272 [2023-08-25 04:41:24,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-25 04:41:24,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 199 transitions, 2442 flow. Second operand has 17 states, 17 states have (on average 138.1764705882353) internal successors, (2349), 17 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:41:24,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:41:24,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-25 04:41:24,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:41:29,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-25 04:41:31,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:41:33,480 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-25 04:41:35,901 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-25 04:41:38,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 04:41:40,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:41:42,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:41:44,343 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-25 04:41:46,349 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-25 04:41:48,357 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-25 04:41:50,362 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-25 04:41:52,366 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-25 04:41:56,890 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-25 04:41:58,946 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-25 04:42:00,953 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-25 04:42:04,996 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-25 04:42:07,027 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-25 04:42:09,040 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-25 04:42:42,403 WARN L234 SmtUtils]: Spent 26.87s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 04:42:44,463 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-25 04:42:46,467 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-25 04:42:48,474 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-25 04:42:50,481 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-25 04:42:52,488 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-25 04:42:54,558 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-25 04:42:56,566 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-25 04:42:58,582 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-25 04:43:00,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:43:02,633 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-25 04:43:05,544 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-25 04:43:18,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 04:43:20,850 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-25 04:43:26,279 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-25 04:43:28,400 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-25 04:43:30,405 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-25 04:43:32,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-25 04:43:34,484 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-25 04:43:36,712 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-25 04:43:39,595 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-25 04:43:41,600 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-25 04:43:43,606 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-25 04:43:45,609 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-25 04:43:47,614 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-25 04:44:33,695 WARN L234 SmtUtils]: Spent 26.80s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 04:44:35,704 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-25 04:44:38,112 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-25 04:44:40,117 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-25 04:44:42,124 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-25 04:44:44,127 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-25 04:44:46,133 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-25 04:44:49,379 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-25 04:44:50,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:44:53,022 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-25 04:44:55,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:44:57,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:45:11,204 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-25 04:45:13,219 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-25 04:45:15,942 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-25 04:45:17,949 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-25 04:45:20,194 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-25 04:45:22,202 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-25 04:45:24,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-25 04:45:26,212 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-25 04:45:29,210 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-25 04:45:31,213 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-25 04:45:33,220 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-25 04:45:35,226 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-25 04:45:37,241 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-25 04:45:38,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:45:40,668 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-25 04:45:42,724 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-25 04:46:01,829 INFO L124 PetriNetUnfolderBase]: 1346/2467 cut-off events. [2023-08-25 04:46:01,829 INFO L125 PetriNetUnfolderBase]: For 32849/32849 co-relation queries the response was YES. [2023-08-25 04:46:01,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15296 conditions, 2467 events. 1346/2467 cut-off events. For 32849/32849 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 13442 event pairs, 145 based on Foata normal form. 54/2521 useless extension candidates. Maximal degree in co-relation 15248. Up to 1149 conditions per place. [2023-08-25 04:46:01,852 INFO L140 encePairwiseOnDemand]: 336/344 looper letters, 229 selfloop transitions, 140 changer transitions 8/377 dead transitions. [2023-08-25 04:46:01,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 377 transitions, 4938 flow [2023-08-25 04:46:01,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-25 04:46:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-25 04:46:01,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3973 transitions. [2023-08-25 04:46:01,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4124792358803987 [2023-08-25 04:46:01,858 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 3973 transitions. [2023-08-25 04:46:01,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 3973 transitions. [2023-08-25 04:46:01,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:46:01,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 3973 transitions. [2023-08-25 04:46:01,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 141.89285714285714) internal successors, (3973), 28 states have internal predecessors, (3973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:46:01,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 344.0) internal successors, (9976), 29 states have internal predecessors, (9976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:46:01,874 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 344.0) internal successors, (9976), 29 states have internal predecessors, (9976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:46:01,874 INFO L175 Difference]: Start difference. First operand has 131 places, 199 transitions, 2442 flow. Second operand 28 states and 3973 transitions. [2023-08-25 04:46:01,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 377 transitions, 4938 flow [2023-08-25 04:46:01,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 377 transitions, 4466 flow, removed 213 selfloop flow, removed 12 redundant places. [2023-08-25 04:46:01,980 INFO L231 Difference]: Finished difference. Result has 158 places, 261 transitions, 3394 flow [2023-08-25 04:46:01,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=2089, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=3394, PETRI_PLACES=158, PETRI_TRANSITIONS=261} [2023-08-25 04:46:01,981 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 118 predicate places. [2023-08-25 04:46:01,981 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 261 transitions, 3394 flow [2023-08-25 04:46:01,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 138.1764705882353) internal successors, (2349), 17 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:46:01,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:46:01,982 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:46:01,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-25 04:46:02,188 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-25 04:46:02,188 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-25 04:46:02,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:46:02,189 INFO L85 PathProgramCache]: Analyzing trace with hash 429716491, now seen corresponding path program 6 times [2023-08-25 04:46:02,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:46:02,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363006310] [2023-08-25 04:46:02,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:46:02,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:46:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:46:02,291 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-25 04:46:02,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:46:02,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363006310] [2023-08-25 04:46:02,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363006310] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 04:46:02,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233000750] [2023-08-25 04:46:02,291 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-25 04:46:02,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:46:02,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:46:02,293 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 04:46:02,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-25 04:46:11,185 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-25 04:46:11,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 04:46:11,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-25 04:46:11,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 04:46:38,991 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (* (- 1) c_~x1~0))) (let ((.cse0 (mod (div c_~x2~0 2) 4294967296)) (.cse2 (div .cse1 2)) (.cse3 (mod c_~n~0 4294967296))) (and (= (mod c_~x2~0 2) 0) (= .cse0 (mod (* 4294967295 (div .cse1 4)) 4294967296)) (< (mod (* 4294967295 .cse2) 4294967296) .cse3) (< .cse0 .cse3) (= (mod .cse2 2) 0) (= (mod c_~x1~0 2) 0) (<= .cse3 (mod c_~x2~0 4294967296))))) is different from false [2023-08-25 04:47:15,287 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (* (- 1) c_~x1~0))) (let ((.cse5 (div .cse1 2)) (.cse0 (mod (div c_~x2~0 2) 4294967296))) (let ((.cse3 (mod c_~x1~0 4294967296)) (.cse2 (+ .cse0 1)) (.cse4 (+ (mod (* 4294967295 .cse5) 4294967296) 1)) (.cse6 (mod c_~x2~0 4294967296))) (and (= (mod c_~x2~0 2) 0) (= .cse0 (mod (* 4294967295 (div .cse1 4)) 4294967296)) (<= .cse2 .cse3) (<= .cse4 .cse3) (= (mod .cse5 2) 0) (<= .cse2 .cse6) (= (mod c_~x1~0 2) 0) (<= .cse4 .cse6))))) is different from false Received shutdown request... [2023-08-25 04:47:18,713 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 04:47:18,713 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 04:47:19,451 WARN L266 SmtUtils]: Removed 2 from assertion stack [2023-08-25 04:47:19,453 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONASSERT (32 of 33 remaining) [2023-08-25 04:47:19,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-25 04:47:19,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-25 04:47:19,654 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. [2023-08-25 04:47:19,655 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2023-08-25 04:47:19,655 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2023-08-25 04:47:19,655 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2023-08-25 04:47:19,655 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2023-08-25 04:47:19,655 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2023-08-25 04:47:19,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (26 of 33 remaining) [2023-08-25 04:47:19,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2023-08-25 04:47:19,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2023-08-25 04:47:19,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2023-08-25 04:47:19,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2023-08-25 04:47:19,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2023-08-25 04:47:19,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2023-08-25 04:47:19,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2023-08-25 04:47:19,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2023-08-25 04:47:19,657 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2023-08-25 04:47:19,657 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2023-08-25 04:47:19,657 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (15 of 33 remaining) [2023-08-25 04:47:19,657 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (14 of 33 remaining) [2023-08-25 04:47:19,657 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (13 of 33 remaining) [2023-08-25 04:47:19,657 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (12 of 33 remaining) [2023-08-25 04:47:19,657 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 33 remaining) [2023-08-25 04:47:19,657 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 33 remaining) [2023-08-25 04:47:19,657 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2023-08-25 04:47:19,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2023-08-25 04:47:19,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2023-08-25 04:47:19,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2023-08-25 04:47:19,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (5 of 33 remaining) [2023-08-25 04:47:19,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2023-08-25 04:47:19,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2023-08-25 04:47:19,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2023-08-25 04:47:19,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2023-08-25 04:47:19,658 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2023-08-25 04:47:19,659 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 2, 1, 1, 1] [2023-08-25 04:47:19,663 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 04:47:19,663 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 04:47:19,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 04:47:19 BasicIcfg [2023-08-25 04:47:19,665 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 04:47:19,665 INFO L158 Benchmark]: Toolchain (without parser) took 875368.32ms. Allocated memory was 404.8MB in the beginning and 585.1MB in the end (delta: 180.4MB). Free memory was 381.5MB in the beginning and 500.1MB in the end (delta: -118.6MB). Peak memory consumption was 63.8MB. Max. memory is 16.0GB. [2023-08-25 04:47:19,665 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 404.8MB. Free memory is still 381.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 04:47:19,666 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.13ms. Allocated memory is still 404.8MB. Free memory was 381.5MB in the beginning and 370.2MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-25 04:47:19,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.91ms. Allocated memory is still 404.8MB. Free memory was 370.2MB in the beginning and 368.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 04:47:19,666 INFO L158 Benchmark]: Boogie Preprocessor took 37.94ms. Allocated memory is still 404.8MB. Free memory was 368.6MB in the beginning and 366.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 04:47:19,666 INFO L158 Benchmark]: RCFGBuilder took 424.65ms. Allocated memory is still 404.8MB. Free memory was 366.9MB in the beginning and 350.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-08-25 04:47:19,666 INFO L158 Benchmark]: TraceAbstraction took 874652.78ms. Allocated memory was 404.8MB in the beginning and 585.1MB in the end (delta: 180.4MB). Free memory was 350.2MB in the beginning and 500.1MB in the end (delta: -149.9MB). Peak memory consumption was 32.4MB. Max. memory is 16.0GB. [2023-08-25 04:47:19,667 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 404.8MB. Free memory is still 381.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 194.13ms. Allocated memory is still 404.8MB. Free memory was 381.5MB in the beginning and 370.2MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 53.91ms. Allocated memory is still 404.8MB. Free memory was 370.2MB in the beginning and 368.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.94ms. Allocated memory is still 404.8MB. Free memory was 368.6MB in the beginning and 366.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 424.65ms. Allocated memory is still 404.8MB. Free memory was 366.9MB in the beginning and 350.6MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 874652.78ms. Allocated memory was 404.8MB in the beginning and 585.1MB in the end (delta: 180.4MB). Free memory was 350.2MB in the beginning and 500.1MB in the end (delta: -149.9MB). Peak memory consumption was 32.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 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 CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - 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 CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - 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 CegarLoopForPetriNet was analyzing trace of length 20 with TraceHistMax 3,while TraceCheckSpWp was constructing forward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 10 for 0ms.. - 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: 874.5s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 563.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 127 mSolverCounterUnknown, 563 SdHoareTripleChecker+Valid, 339.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 563 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 337.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 774 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 104 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2712 IncrementalHoareTripleChecker+Invalid, 3717 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 104 mSolverCounterUnsat, 0 mSDtfsCounter, 2712 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 175 SyntacticMatches, 17 SemanticMatches, 136 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 288.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3394occurred in iteration=12, InterpolantAutomatonStates: 135, 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, 9.3s SatisfiabilityAnalysisTime, 217.9s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 385 ConstructedInterpolants, 0 QuantifiedInterpolants, 11779 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1164 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 26 InterpolantComputations, 5 PerfectInterpolantSequences, 21/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