/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-exp2x4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 04:34:39,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 04:34:39,169 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:34:39,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 04:34:39,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 04:34:39,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 04:34:39,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 04:34:39,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 04:34:39,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 04:34:39,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 04:34:39,208 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 04:34:39,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 04:34:39,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 04:34:39,209 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 04:34:39,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 04:34:39,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 04:34:39,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 04:34:39,209 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 04:34:39,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 04:34:39,210 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 04:34:39,210 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 04:34:39,210 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 04:34:39,210 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 04:34:39,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 04:34:39,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 04:34:39,211 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 04:34:39,211 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 04:34:39,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 04:34:39,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 04:34:39,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 04:34:39,212 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 04:34:39,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 04:34:39,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 04:34:39,213 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 04:34:39,213 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 04:34:39,213 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:34:39,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 04:34:39,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 04:34:39,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 04:34:39,490 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 04:34:39,490 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 04:34:39,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2023-08-25 04:34:40,441 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 04:34:40,617 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 04:34:40,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2023-08-25 04:34:40,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6a4e28fe/35c33461f4e646dca5cd3de367940624/FLAG03d3e0a59 [2023-08-25 04:34:40,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6a4e28fe/35c33461f4e646dca5cd3de367940624 [2023-08-25 04:34:40,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 04:34:40,641 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 04:34:40,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 04:34:40,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 04:34:40,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 04:34:40,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 04:34:40" (1/1) ... [2023-08-25 04:34:40,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba158f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:34:40, skipping insertion in model container [2023-08-25 04:34:40,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 04:34:40" (1/1) ... [2023-08-25 04:34:40,664 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 04:34:40,799 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 04:34:40,807 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 04:34:40,842 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 04:34:40,854 INFO L206 MainTranslator]: Completed translation [2023-08-25 04:34:40,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:34:40 WrapperNode [2023-08-25 04:34:40,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 04:34:40,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 04:34:40,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 04:34:40,857 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 04:34:40,861 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:34:40" (1/1) ... [2023-08-25 04:34:40,879 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:34:40" (1/1) ... [2023-08-25 04:34:40,905 INFO L138 Inliner]: procedures = 20, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 174 [2023-08-25 04:34:40,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 04:34:40,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 04:34:40,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 04:34:40,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 04:34:40,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:34:40" (1/1) ... [2023-08-25 04:34:40,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:34:40" (1/1) ... [2023-08-25 04:34:40,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:34:40" (1/1) ... [2023-08-25 04:34:40,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:34:40" (1/1) ... [2023-08-25 04:34:40,940 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:34:40" (1/1) ... [2023-08-25 04:34:40,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:34:40" (1/1) ... [2023-08-25 04:34:40,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:34:40" (1/1) ... [2023-08-25 04:34:40,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:34:40" (1/1) ... [2023-08-25 04:34:40,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 04:34:40,946 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 04:34:40,946 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 04:34:40,946 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 04:34:40,947 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:34:40" (1/1) ... [2023-08-25 04:34:40,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 04:34:40,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:34:40,979 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:34:40,996 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:34:41,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 04:34:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 04:34:41,012 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 04:34:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 04:34:41,012 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 04:34:41,012 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-25 04:34:41,013 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-25 04:34:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-25 04:34:41,013 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-25 04:34:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 04:34:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 04:34:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 04:34:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 04:34:41,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 04:34:41,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 04:34:41,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 04:34:41,014 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:34:41,098 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 04:34:41,099 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 04:34:41,431 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 04:34:41,441 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 04:34:41,441 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-25 04:34:41,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 04:34:41 BoogieIcfgContainer [2023-08-25 04:34:41,443 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 04:34:41,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 04:34:41,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 04:34:41,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 04:34:41,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 04:34:40" (1/3) ... [2023-08-25 04:34:41,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2d9d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 04:34:41, skipping insertion in model container [2023-08-25 04:34:41,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:34:40" (2/3) ... [2023-08-25 04:34:41,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2d9d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 04:34:41, skipping insertion in model container [2023-08-25 04:34:41,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 04:34:41" (3/3) ... [2023-08-25 04:34:41,448 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2023-08-25 04:34:41,459 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 04:34:41,460 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2023-08-25 04:34:41,460 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 04:34:41,583 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-25 04:34:41,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 338 places, 339 transitions, 710 flow [2023-08-25 04:34:41,739 INFO L124 PetriNetUnfolderBase]: 14/335 cut-off events. [2023-08-25 04:34:41,740 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-25 04:34:41,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 335 events. 14/335 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 668 event pairs, 0 based on Foata normal form. 0/269 useless extension candidates. Maximal degree in co-relation 229. Up to 2 conditions per place. [2023-08-25 04:34:41,749 INFO L82 GeneralOperation]: Start removeDead. Operand has 338 places, 339 transitions, 710 flow [2023-08-25 04:34:41,758 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 321 places, 322 transitions, 668 flow [2023-08-25 04:34:41,760 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 04:34:41,770 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 321 places, 322 transitions, 668 flow [2023-08-25 04:34:41,773 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 321 places, 322 transitions, 668 flow [2023-08-25 04:34:41,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 321 places, 322 transitions, 668 flow [2023-08-25 04:34:41,816 INFO L124 PetriNetUnfolderBase]: 14/322 cut-off events. [2023-08-25 04:34:41,817 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-25 04:34:41,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 322 events. 14/322 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 667 event pairs, 0 based on Foata normal form. 0/257 useless extension candidates. Maximal degree in co-relation 229. Up to 2 conditions per place. [2023-08-25 04:34:41,827 INFO L119 LiptonReduction]: Number of co-enabled transitions 23520 [2023-08-25 04:34:48,676 INFO L134 LiptonReduction]: Checked pairs total: 39864 [2023-08-25 04:34:48,676 INFO L136 LiptonReduction]: Total number of compositions: 429 [2023-08-25 04:34:48,685 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 04:34:48,689 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;@93c0c4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 04:34:48,689 INFO L358 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2023-08-25 04:34:48,690 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 04:34:48,690 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 04:34:48,690 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 04:34:48,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:34:48,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 04:34:48,691 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2023-08-25 04:34:48,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:34:48,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1289, now seen corresponding path program 1 times [2023-08-25 04:34:48,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:34:48,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039167354] [2023-08-25 04:34:48,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:34:48,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:34:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:34:48,756 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:34:48,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:34:48,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039167354] [2023-08-25 04:34:48,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039167354] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:34:48,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:34:48,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 04:34:48,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723809527] [2023-08-25 04:34:48,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:34:48,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 04:34:48,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:34:48,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 04:34:48,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 04:34:48,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 768 [2023-08-25 04:34:48,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 84 transitions, 192 flow. Second operand has 2 states, 2 states have (on average 324.5) internal successors, (649), 2 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:34:48,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:34:48,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 768 [2023-08-25 04:34:48,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:34:48,917 INFO L124 PetriNetUnfolderBase]: 976/1373 cut-off events. [2023-08-25 04:34:48,918 INFO L125 PetriNetUnfolderBase]: For 98/98 co-relation queries the response was YES. [2023-08-25 04:34:48,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2796 conditions, 1373 events. 976/1373 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4523 event pairs, 624 based on Foata normal form. 0/1021 useless extension candidates. Maximal degree in co-relation 2176. Up to 1298 conditions per place. [2023-08-25 04:34:48,924 INFO L140 encePairwiseOnDemand]: 717/768 looper letters, 29 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-08-25 04:34:48,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 148 flow [2023-08-25 04:34:48,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 04:34:48,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 04:34:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 728 transitions. [2023-08-25 04:34:48,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4739583333333333 [2023-08-25 04:34:48,939 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 728 transitions. [2023-08-25 04:34:48,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 728 transitions. [2023-08-25 04:34:48,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:34:48,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 728 transitions. [2023-08-25 04:34:48,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 364.0) internal successors, (728), 2 states have internal predecessors, (728), 0 states have call successors, (0), 0 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:48,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 768.0) internal successors, (2304), 3 states have internal predecessors, (2304), 0 states have call successors, (0), 0 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:48,952 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 768.0) internal successors, (2304), 3 states have internal predecessors, (2304), 0 states have call successors, (0), 0 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:48,954 INFO L175 Difference]: Start difference. First operand has 89 places, 84 transitions, 192 flow. Second operand 2 states and 728 transitions. [2023-08-25 04:34:48,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 148 flow [2023-08-25 04:34:48,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-25 04:34:48,959 INFO L231 Difference]: Finished difference. Result has 35 places, 33 transitions, 74 flow [2023-08-25 04:34:48,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=768, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=35, PETRI_TRANSITIONS=33} [2023-08-25 04:34:48,963 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -54 predicate places. [2023-08-25 04:34:48,963 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 33 transitions, 74 flow [2023-08-25 04:34:48,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 324.5) internal successors, (649), 2 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:34:48,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:34:48,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-25 04:34:48,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 04:34:48,964 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2023-08-25 04:34:48,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:34:48,970 INFO L85 PathProgramCache]: Analyzing trace with hash 40791063, now seen corresponding path program 1 times [2023-08-25 04:34:48,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:34:48,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190750960] [2023-08-25 04:34:48,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:34:48,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:34:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:34:49,073 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:34:49,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:34:49,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190750960] [2023-08-25 04:34:49,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190750960] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:34:49,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:34:49,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 04:34:49,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578961400] [2023-08-25 04:34:49,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:34:49,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 04:34:49,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:34:49,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 04:34:49,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 04:34:49,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 768 [2023-08-25 04:34:49,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 310.3333333333333) internal successors, (931), 3 states have internal predecessors, (931), 0 states have call successors, (0), 0 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:49,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:34:49,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 768 [2023-08-25 04:34:49,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:34:49,170 INFO L124 PetriNetUnfolderBase]: 995/1324 cut-off events. [2023-08-25 04:34:49,170 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-25 04:34:49,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2694 conditions, 1324 events. 995/1324 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3824 event pairs, 376 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 2691. Up to 1315 conditions per place. [2023-08-25 04:34:49,175 INFO L140 encePairwiseOnDemand]: 760/768 looper letters, 36 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2023-08-25 04:34:49,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 171 flow [2023-08-25 04:34:49,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 04:34:49,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 04:34:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2023-08-25 04:34:49,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4214409722222222 [2023-08-25 04:34:49,178 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 971 transitions. [2023-08-25 04:34:49,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 971 transitions. [2023-08-25 04:34:49,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:34:49,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 971 transitions. [2023-08-25 04:34:49,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.6666666666667) internal successors, (971), 3 states have internal predecessors, (971), 0 states have call successors, (0), 0 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:49,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 768.0) internal successors, (3072), 4 states have internal predecessors, (3072), 0 states have call successors, (0), 0 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:49,185 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 768.0) internal successors, (3072), 4 states have internal predecessors, (3072), 0 states have call successors, (0), 0 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:49,185 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 74 flow. Second operand 3 states and 971 transitions. [2023-08-25 04:34:49,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 40 transitions, 171 flow [2023-08-25 04:34:49,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 171 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 04:34:49,186 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 94 flow [2023-08-25 04:34:49,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=768, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2023-08-25 04:34:49,188 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -55 predicate places. [2023-08-25 04:34:49,188 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 94 flow [2023-08-25 04:34:49,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.3333333333333) internal successors, (931), 3 states have internal predecessors, (931), 0 states have call successors, (0), 0 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:49,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:34:49,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:34:49,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 04:34:49,191 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2023-08-25 04:34:49,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:34:49,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1314293397, now seen corresponding path program 1 times [2023-08-25 04:34:49,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:34:49,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871075782] [2023-08-25 04:34:49,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:34:49,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:34:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:34:49,432 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:34:49,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:34:49,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871075782] [2023-08-25 04:34:49,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871075782] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:34:49,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:34:49,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 04:34:49,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390001625] [2023-08-25 04:34:49,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:34:49,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 04:34:49,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:34:49,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 04:34:49,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 04:34:49,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 768 [2023-08-25 04:34:49,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 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:49,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:34:49,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 768 [2023-08-25 04:34:49,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:34:49,653 INFO L124 PetriNetUnfolderBase]: 1951/2591 cut-off events. [2023-08-25 04:34:49,653 INFO L125 PetriNetUnfolderBase]: For 438/438 co-relation queries the response was YES. [2023-08-25 04:34:49,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5989 conditions, 2591 events. 1951/2591 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8951 event pairs, 528 based on Foata normal form. 1/1888 useless extension candidates. Maximal degree in co-relation 5985. Up to 1648 conditions per place. [2023-08-25 04:34:49,663 INFO L140 encePairwiseOnDemand]: 762/768 looper letters, 53 selfloop transitions, 5 changer transitions 1/59 dead transitions. [2023-08-25 04:34:49,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 59 transitions, 279 flow [2023-08-25 04:34:49,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 04:34:49,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 04:34:49,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 938 transitions. [2023-08-25 04:34:49,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4071180555555556 [2023-08-25 04:34:49,666 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 938 transitions. [2023-08-25 04:34:49,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 938 transitions. [2023-08-25 04:34:49,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:34:49,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 938 transitions. [2023-08-25 04:34:49,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 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:49,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 768.0) internal successors, (3072), 4 states have internal predecessors, (3072), 0 states have call successors, (0), 0 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:49,672 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 768.0) internal successors, (3072), 4 states have internal predecessors, (3072), 0 states have call successors, (0), 0 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:49,672 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 94 flow. Second operand 3 states and 938 transitions. [2023-08-25 04:34:49,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 59 transitions, 279 flow [2023-08-25 04:34:49,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 59 transitions, 279 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 04:34:49,673 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 127 flow [2023-08-25 04:34:49,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=768, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=37, PETRI_TRANSITIONS=37} [2023-08-25 04:34:49,674 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -52 predicate places. [2023-08-25 04:34:49,674 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 127 flow [2023-08-25 04:34:49,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 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:49,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:34:49,675 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:34:49,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 04:34:49,675 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2023-08-25 04:34:49,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:34:49,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2073042138, now seen corresponding path program 1 times [2023-08-25 04:34:49,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:34:49,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141747207] [2023-08-25 04:34:49,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:34:49,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:34:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:34:49,746 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:34:49,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:34:49,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141747207] [2023-08-25 04:34:49,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141747207] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:34:49,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:34:49,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 04:34:49,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152230047] [2023-08-25 04:34:49,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:34:49,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 04:34:49,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:34:49,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 04:34:49,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 04:34:49,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 768 [2023-08-25 04:34:49,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 309.75) internal successors, (1239), 4 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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:49,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:34:49,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 768 [2023-08-25 04:34:49,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:34:50,014 INFO L124 PetriNetUnfolderBase]: 2798/3734 cut-off events. [2023-08-25 04:34:50,015 INFO L125 PetriNetUnfolderBase]: For 1697/1697 co-relation queries the response was YES. [2023-08-25 04:34:50,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9909 conditions, 3734 events. 2798/3734 cut-off events. For 1697/1697 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14414 event pairs, 281 based on Foata normal form. 86/3820 useless extension candidates. Maximal degree in co-relation 9903. Up to 1515 conditions per place. [2023-08-25 04:34:50,031 INFO L140 encePairwiseOnDemand]: 763/768 looper letters, 91 selfloop transitions, 10 changer transitions 0/101 dead transitions. [2023-08-25 04:34:50,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 101 transitions, 523 flow [2023-08-25 04:34:50,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 04:34:50,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 04:34:50,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1606 transitions. [2023-08-25 04:34:50,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41822916666666665 [2023-08-25 04:34:50,034 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1606 transitions. [2023-08-25 04:34:50,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1606 transitions. [2023-08-25 04:34:50,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:34:50,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1606 transitions. [2023-08-25 04:34:50,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 321.2) internal successors, (1606), 5 states have internal predecessors, (1606), 0 states have call successors, (0), 0 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:50,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 768.0) internal successors, (4608), 6 states have internal predecessors, (4608), 0 states have call successors, (0), 0 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:50,043 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 768.0) internal successors, (4608), 6 states have internal predecessors, (4608), 0 states have call successors, (0), 0 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:50,043 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 127 flow. Second operand 5 states and 1606 transitions. [2023-08-25 04:34:50,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 101 transitions, 523 flow [2023-08-25 04:34:50,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 101 transitions, 515 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 04:34:50,045 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 187 flow [2023-08-25 04:34:50,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=768, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=42, PETRI_TRANSITIONS=44} [2023-08-25 04:34:50,046 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -47 predicate places. [2023-08-25 04:34:50,046 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 187 flow [2023-08-25 04:34:50,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 309.75) internal successors, (1239), 4 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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:50,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:34:50,047 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:34:50,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 04:34:50,047 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2023-08-25 04:34:50,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:34:50,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1285370264, now seen corresponding path program 1 times [2023-08-25 04:34:50,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:34:50,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947394719] [2023-08-25 04:34:50,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:34:50,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:34:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:34:50,105 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:34:50,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:34:50,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947394719] [2023-08-25 04:34:50,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947394719] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 04:34:50,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617340661] [2023-08-25 04:34:50,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:34:50,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:34:50,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:34:50,108 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:34:50,116 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:34:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:34:50,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 04:34:50,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 04:34:50,303 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:34:50,303 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 04:34:50,372 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:34:50,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617340661] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 04:34:50,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 04:34:50,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-25 04:34:50,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103289643] [2023-08-25 04:34:50,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 04:34:50,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 04:34:50,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:34:50,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 04:34:50,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 04:34:50,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 768 [2023-08-25 04:34:50,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 309.75) internal successors, (1239), 4 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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:50,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:34:50,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 768 [2023-08-25 04:34:50,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:34:50,932 INFO L124 PetriNetUnfolderBase]: 5077/6793 cut-off events. [2023-08-25 04:34:50,932 INFO L125 PetriNetUnfolderBase]: For 6511/6511 co-relation queries the response was YES. [2023-08-25 04:34:50,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20342 conditions, 6793 events. 5077/6793 cut-off events. For 6511/6511 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 27810 event pairs, 1179 based on Foata normal form. 160/6953 useless extension candidates. Maximal degree in co-relation 20334. Up to 2311 conditions per place. [2023-08-25 04:34:50,971 INFO L140 encePairwiseOnDemand]: 763/768 looper letters, 109 selfloop transitions, 8 changer transitions 0/117 dead transitions. [2023-08-25 04:34:50,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 117 transitions, 723 flow [2023-08-25 04:34:50,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 04:34:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 04:34:50,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1604 transitions. [2023-08-25 04:34:50,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41770833333333335 [2023-08-25 04:34:50,975 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1604 transitions. [2023-08-25 04:34:50,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1604 transitions. [2023-08-25 04:34:50,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:34:50,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1604 transitions. [2023-08-25 04:34:50,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 320.8) internal successors, (1604), 5 states have internal predecessors, (1604), 0 states have call successors, (0), 0 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:50,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 768.0) internal successors, (4608), 6 states have internal predecessors, (4608), 0 states have call successors, (0), 0 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:50,983 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 768.0) internal successors, (4608), 6 states have internal predecessors, (4608), 0 states have call successors, (0), 0 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:50,983 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 187 flow. Second operand 5 states and 1604 transitions. [2023-08-25 04:34:50,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 117 transitions, 723 flow [2023-08-25 04:34:50,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 117 transitions, 723 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 04:34:50,990 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 242 flow [2023-08-25 04:34:50,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=768, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2023-08-25 04:34:50,992 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -40 predicate places. [2023-08-25 04:34:50,992 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 49 transitions, 242 flow [2023-08-25 04:34:50,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 309.75) internal successors, (1239), 4 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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:50,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:34:50,992 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:34:50,999 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:34:51,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:34:51,199 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2023-08-25 04:34:51,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:34:51,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2045575426, now seen corresponding path program 2 times [2023-08-25 04:34:51,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:34:51,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559929521] [2023-08-25 04:34:51,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:34:51,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:34:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:34:51,261 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:34:51,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:34:51,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559929521] [2023-08-25 04:34:51,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559929521] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:34:51,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:34:51,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 04:34:51,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129444110] [2023-08-25 04:34:51,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:34:51,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 04:34:51,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:34:51,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 04:34:51,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 04:34:51,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 768 [2023-08-25 04:34:51,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 49 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 309.75) internal successors, (1239), 4 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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:51,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:34:51,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 768 [2023-08-25 04:34:51,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:34:51,649 INFO L124 PetriNetUnfolderBase]: 4683/6235 cut-off events. [2023-08-25 04:34:51,649 INFO L125 PetriNetUnfolderBase]: For 8440/8440 co-relation queries the response was YES. [2023-08-25 04:34:51,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21309 conditions, 6235 events. 4683/6235 cut-off events. For 8440/8440 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 24993 event pairs, 523 based on Foata normal form. 52/6287 useless extension candidates. Maximal degree in co-relation 21297. Up to 2709 conditions per place. [2023-08-25 04:34:51,678 INFO L140 encePairwiseOnDemand]: 763/768 looper letters, 109 selfloop transitions, 11 changer transitions 0/120 dead transitions. [2023-08-25 04:34:51,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 120 transitions, 797 flow [2023-08-25 04:34:51,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 04:34:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 04:34:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1602 transitions. [2023-08-25 04:34:51,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4171875 [2023-08-25 04:34:51,682 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1602 transitions. [2023-08-25 04:34:51,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1602 transitions. [2023-08-25 04:34:51,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:34:51,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1602 transitions. [2023-08-25 04:34:51,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 320.4) internal successors, (1602), 5 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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:51,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 768.0) internal successors, (4608), 6 states have internal predecessors, (4608), 0 states have call successors, (0), 0 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:51,689 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 768.0) internal successors, (4608), 6 states have internal predecessors, (4608), 0 states have call successors, (0), 0 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:51,689 INFO L175 Difference]: Start difference. First operand has 49 places, 49 transitions, 242 flow. Second operand 5 states and 1602 transitions. [2023-08-25 04:34:51,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 120 transitions, 797 flow [2023-08-25 04:34:51,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 120 transitions, 797 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 04:34:51,709 INFO L231 Difference]: Finished difference. Result has 54 places, 54 transitions, 303 flow [2023-08-25 04:34:51,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=768, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=303, PETRI_PLACES=54, PETRI_TRANSITIONS=54} [2023-08-25 04:34:51,710 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -35 predicate places. [2023-08-25 04:34:51,710 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 54 transitions, 303 flow [2023-08-25 04:34:51,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 309.75) internal successors, (1239), 4 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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:51,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:34:51,711 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:34:51,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 04:34:51,711 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2023-08-25 04:34:51,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:34:51,711 INFO L85 PathProgramCache]: Analyzing trace with hash -191883414, now seen corresponding path program 1 times [2023-08-25 04:34:51,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:34:51,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148873531] [2023-08-25 04:34:51,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:34:51,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:34:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:34:51,769 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:34:51,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:34:51,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148873531] [2023-08-25 04:34:51,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148873531] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:34:51,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:34:51,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 04:34:51,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375273799] [2023-08-25 04:34:51,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:34:51,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 04:34:51,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:34:51,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 04:34:51,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 04:34:51,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 768 [2023-08-25 04:34:51,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 54 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 309.75) internal successors, (1239), 4 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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:51,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:34:51,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 768 [2023-08-25 04:34:51,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:34:52,168 INFO L124 PetriNetUnfolderBase]: 4627/6179 cut-off events. [2023-08-25 04:34:52,169 INFO L125 PetriNetUnfolderBase]: For 10580/10580 co-relation queries the response was YES. [2023-08-25 04:34:52,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22572 conditions, 6179 events. 4627/6179 cut-off events. For 10580/10580 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 24974 event pairs, 579 based on Foata normal form. 56/6235 useless extension candidates. Maximal degree in co-relation 22558. Up to 3319 conditions per place. [2023-08-25 04:34:52,199 INFO L140 encePairwiseOnDemand]: 763/768 looper letters, 108 selfloop transitions, 8 changer transitions 2/118 dead transitions. [2023-08-25 04:34:52,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 118 transitions, 810 flow [2023-08-25 04:34:52,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 04:34:52,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 04:34:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1601 transitions. [2023-08-25 04:34:52,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41692708333333334 [2023-08-25 04:34:52,203 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1601 transitions. [2023-08-25 04:34:52,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1601 transitions. [2023-08-25 04:34:52,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:34:52,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1601 transitions. [2023-08-25 04:34:52,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 320.2) internal successors, (1601), 5 states have internal predecessors, (1601), 0 states have call successors, (0), 0 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:52,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 768.0) internal successors, (4608), 6 states have internal predecessors, (4608), 0 states have call successors, (0), 0 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:52,210 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 768.0) internal successors, (4608), 6 states have internal predecessors, (4608), 0 states have call successors, (0), 0 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:52,210 INFO L175 Difference]: Start difference. First operand has 54 places, 54 transitions, 303 flow. Second operand 5 states and 1601 transitions. [2023-08-25 04:34:52,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 118 transitions, 810 flow [2023-08-25 04:34:52,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 118 transitions, 799 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-25 04:34:52,229 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 306 flow [2023-08-25 04:34:52,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=768, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=306, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2023-08-25 04:34:52,229 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -31 predicate places. [2023-08-25 04:34:52,230 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 306 flow [2023-08-25 04:34:52,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 309.75) internal successors, (1239), 4 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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:52,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:34:52,230 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:34:52,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 04:34:52,230 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2023-08-25 04:34:52,231 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:34:52,231 INFO L85 PathProgramCache]: Analyzing trace with hash 28341312, now seen corresponding path program 2 times [2023-08-25 04:34:52,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:34:52,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518916901] [2023-08-25 04:34:52,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:34:52,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:34:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:34:52,290 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:34:52,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:34:52,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518916901] [2023-08-25 04:34:52,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518916901] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 04:34:52,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702084923] [2023-08-25 04:34:52,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 04:34:52,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:34:52,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:34:52,293 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:34:52,295 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:34:52,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 04:34:52,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 04:34:52,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 04:34:52,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 04:34:52,476 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:34:52,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 04:34:52,542 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:34:52,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702084923] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 04:34:52,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 04:34:52,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-25 04:34:52,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67158608] [2023-08-25 04:34:52,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 04:34:52,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 04:34:52,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:34:52,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 04:34:52,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 04:34:52,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 768 [2023-08-25 04:34:52,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 309.75) internal successors, (1239), 4 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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:52,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:34:52,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 768 [2023-08-25 04:34:52,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:34:53,112 INFO L124 PetriNetUnfolderBase]: 5623/7487 cut-off events. [2023-08-25 04:34:53,112 INFO L125 PetriNetUnfolderBase]: For 14232/14232 co-relation queries the response was YES. [2023-08-25 04:34:53,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27822 conditions, 7487 events. 5623/7487 cut-off events. For 14232/14232 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 30376 event pairs, 1295 based on Foata normal form. 156/7643 useless extension candidates. Maximal degree in co-relation 27807. Up to 4037 conditions per place. [2023-08-25 04:34:53,160 INFO L140 encePairwiseOnDemand]: 763/768 looper letters, 108 selfloop transitions, 8 changer transitions 0/116 dead transitions. [2023-08-25 04:34:53,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 116 transitions, 826 flow [2023-08-25 04:34:53,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 04:34:53,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 04:34:53,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1598 transitions. [2023-08-25 04:34:53,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161458333333333 [2023-08-25 04:34:53,164 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1598 transitions. [2023-08-25 04:34:53,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1598 transitions. [2023-08-25 04:34:53,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:34:53,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1598 transitions. [2023-08-25 04:34:53,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 319.6) internal successors, (1598), 5 states have internal predecessors, (1598), 0 states have call successors, (0), 0 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:53,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 768.0) internal successors, (4608), 6 states have internal predecessors, (4608), 0 states have call successors, (0), 0 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:53,184 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 768.0) internal successors, (4608), 6 states have internal predecessors, (4608), 0 states have call successors, (0), 0 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:53,185 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 306 flow. Second operand 5 states and 1598 transitions. [2023-08-25 04:34:53,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 116 transitions, 826 flow [2023-08-25 04:34:53,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 116 transitions, 813 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-25 04:34:53,210 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 346 flow [2023-08-25 04:34:53,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=768, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=346, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2023-08-25 04:34:53,211 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -26 predicate places. [2023-08-25 04:34:53,211 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 346 flow [2023-08-25 04:34:53,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 309.75) internal successors, (1239), 4 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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:53,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:34:53,212 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:34:53,218 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:34:53,416 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,SelfDestructingSolverStorable7 [2023-08-25 04:34:53,416 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2023-08-25 04:34:53,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:34:53,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1455096170, now seen corresponding path program 1 times [2023-08-25 04:34:53,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:34:53,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183650789] [2023-08-25 04:34:53,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:34:53,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:34:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:34:53,496 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:34:53,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:34:53,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183650789] [2023-08-25 04:34:53,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183650789] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 04:34:53,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754353867] [2023-08-25 04:34:53,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:34:53,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:34:53,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:34:53,499 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:34:53,501 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:34:53,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:34:53,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 04:34:53,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 04:34:53,645 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:34:53,645 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 04:34:53,684 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:34:53,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754353867] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 04:34:53,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 04:34:53,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-25 04:34:53,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137504123] [2023-08-25 04:34:53,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 04:34:53,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 04:34:53,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:34:53,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 04:34:53,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 04:34:53,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 768 [2023-08-25 04:34:53,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 346 flow. Second operand has 4 states, 4 states have (on average 309.75) internal successors, (1239), 4 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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:53,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:34:53,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 768 [2023-08-25 04:34:53,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:34:54,306 INFO L124 PetriNetUnfolderBase]: 8213/11003 cut-off events. [2023-08-25 04:34:54,306 INFO L125 PetriNetUnfolderBase]: For 26191/26191 co-relation queries the response was YES. [2023-08-25 04:34:54,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42836 conditions, 11003 events. 8213/11003 cut-off events. For 26191/26191 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 48881 event pairs, 2543 based on Foata normal form. 282/11285 useless extension candidates. Maximal degree in co-relation 42818. Up to 4229 conditions per place. [2023-08-25 04:34:54,371 INFO L140 encePairwiseOnDemand]: 763/768 looper letters, 143 selfloop transitions, 10 changer transitions 0/153 dead transitions. [2023-08-25 04:34:54,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 153 transitions, 1216 flow [2023-08-25 04:34:54,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 04:34:54,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 04:34:54,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1612 transitions. [2023-08-25 04:34:54,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4197916666666667 [2023-08-25 04:34:54,482 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1612 transitions. [2023-08-25 04:34:54,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1612 transitions. [2023-08-25 04:34:54,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:34:54,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1612 transitions. [2023-08-25 04:34:54,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 322.4) internal successors, (1612), 5 states have internal predecessors, (1612), 0 states have call successors, (0), 0 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:54,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 768.0) internal successors, (4608), 6 states have internal predecessors, (4608), 0 states have call successors, (0), 0 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:54,488 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 768.0) internal successors, (4608), 6 states have internal predecessors, (4608), 0 states have call successors, (0), 0 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:54,488 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 346 flow. Second operand 5 states and 1612 transitions. [2023-08-25 04:34:54,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 153 transitions, 1216 flow [2023-08-25 04:34:54,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 153 transitions, 1158 flow, removed 20 selfloop flow, removed 2 redundant places. [2023-08-25 04:34:54,530 INFO L231 Difference]: Finished difference. Result has 67 places, 59 transitions, 382 flow [2023-08-25 04:34:54,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=768, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=382, PETRI_PLACES=67, PETRI_TRANSITIONS=59} [2023-08-25 04:34:54,531 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -22 predicate places. [2023-08-25 04:34:54,531 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 59 transitions, 382 flow [2023-08-25 04:34:54,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 309.75) internal successors, (1239), 4 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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:54,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:34:54,532 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:34:54,538 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:34:54,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:34:54,743 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2023-08-25 04:34:54,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:34:54,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1104347122, now seen corresponding path program 2 times [2023-08-25 04:34:54,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:34:54,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762209024] [2023-08-25 04:34:54,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:34:54,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:34:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:34:54,878 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:34:54,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:34:54,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762209024] [2023-08-25 04:34:54,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762209024] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:34:54,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:34:54,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 04:34:54,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929547041] [2023-08-25 04:34:54,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:34:54,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 04:34:54,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:34:54,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 04:34:54,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 04:34:54,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 768 [2023-08-25 04:34:54,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 59 transitions, 382 flow. Second operand has 4 states, 4 states have (on average 309.75) internal successors, (1239), 4 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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:54,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:34:54,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 768 [2023-08-25 04:34:54,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:34:55,514 INFO L124 PetriNetUnfolderBase]: 7377/9805 cut-off events. [2023-08-25 04:34:55,514 INFO L125 PetriNetUnfolderBase]: For 25907/25907 co-relation queries the response was YES. [2023-08-25 04:34:55,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39227 conditions, 9805 events. 7377/9805 cut-off events. For 25907/25907 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 43221 event pairs, 735 based on Foata normal form. 74/9879 useless extension candidates. Maximal degree in co-relation 39207. Up to 3507 conditions per place. [2023-08-25 04:34:55,570 INFO L140 encePairwiseOnDemand]: 763/768 looper letters, 133 selfloop transitions, 9 changer transitions 4/146 dead transitions. [2023-08-25 04:34:55,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 146 transitions, 1155 flow [2023-08-25 04:34:55,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 04:34:55,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 04:34:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1605 transitions. [2023-08-25 04:34:55,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41796875 [2023-08-25 04:34:55,574 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1605 transitions. [2023-08-25 04:34:55,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1605 transitions. [2023-08-25 04:34:55,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:34:55,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1605 transitions. [2023-08-25 04:34:55,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 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:55,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 768.0) internal successors, (4608), 6 states have internal predecessors, (4608), 0 states have call successors, (0), 0 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:55,581 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 768.0) internal successors, (4608), 6 states have internal predecessors, (4608), 0 states have call successors, (0), 0 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:55,581 INFO L175 Difference]: Start difference. First operand has 67 places, 59 transitions, 382 flow. Second operand 5 states and 1605 transitions. [2023-08-25 04:34:55,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 146 transitions, 1155 flow [2023-08-25 04:34:55,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 146 transitions, 1146 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-25 04:34:55,638 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 386 flow [2023-08-25 04:34:55,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=768, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=386, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2023-08-25 04:34:55,638 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -18 predicate places. [2023-08-25 04:34:55,638 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 386 flow [2023-08-25 04:34:55,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 309.75) internal successors, (1239), 4 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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:55,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:34:55,639 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:34:55,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 04:34:55,639 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2023-08-25 04:34:55,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:34:55,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1027110368, now seen corresponding path program 2 times [2023-08-25 04:34:55,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:34:55,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042390371] [2023-08-25 04:34:55,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:34:55,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:34:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:34:55,712 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:34:55,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:34:55,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042390371] [2023-08-25 04:34:55,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042390371] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 04:34:55,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842232425] [2023-08-25 04:34:55,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 04:34:55,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:34:55,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:34:55,713 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:34:55,715 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:34:55,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 04:34:55,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 04:34:55,847 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 04:34:55,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 04:34:55,903 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:34:55,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 04:34:55,952 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:34:55,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842232425] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 04:34:55,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 04:34:55,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-25 04:34:55,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138357595] [2023-08-25 04:34:55,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 04:34:55,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 04:34:55,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:34:55,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 04:34:55,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 04:34:55,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 768 [2023-08-25 04:34:55,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 386 flow. Second operand has 4 states, 4 states have (on average 309.75) internal successors, (1239), 4 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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:55,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:34:55,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 768 [2023-08-25 04:34:55,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:34:56,702 INFO L124 PetriNetUnfolderBase]: 8853/11725 cut-off events. [2023-08-25 04:34:56,702 INFO L125 PetriNetUnfolderBase]: For 33147/33147 co-relation queries the response was YES. [2023-08-25 04:34:56,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48225 conditions, 11725 events. 8853/11725 cut-off events. For 33147/33147 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 50782 event pairs, 3073 based on Foata normal form. 222/11947 useless extension candidates. Maximal degree in co-relation 48204. Up to 6575 conditions per place. [2023-08-25 04:34:56,763 INFO L140 encePairwiseOnDemand]: 763/768 looper letters, 136 selfloop transitions, 8 changer transitions 0/144 dead transitions. [2023-08-25 04:34:56,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 144 transitions, 1175 flow [2023-08-25 04:34:56,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 04:34:56,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 04:34:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1602 transitions. [2023-08-25 04:34:56,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4171875 [2023-08-25 04:34:56,766 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1602 transitions. [2023-08-25 04:34:56,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1602 transitions. [2023-08-25 04:34:56,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:34:56,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1602 transitions. [2023-08-25 04:34:56,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 320.4) internal successors, (1602), 5 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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:56,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 768.0) internal successors, (4608), 6 states have internal predecessors, (4608), 0 states have call successors, (0), 0 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:56,773 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 768.0) internal successors, (4608), 6 states have internal predecessors, (4608), 0 states have call successors, (0), 0 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:56,773 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 386 flow. Second operand 5 states and 1602 transitions. [2023-08-25 04:34:56,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 144 transitions, 1175 flow [2023-08-25 04:34:56,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 144 transitions, 1168 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 04:34:56,804 INFO L231 Difference]: Finished difference. Result has 76 places, 61 transitions, 433 flow [2023-08-25 04:34:56,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=768, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=433, PETRI_PLACES=76, PETRI_TRANSITIONS=61} [2023-08-25 04:34:56,805 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -13 predicate places. [2023-08-25 04:34:56,805 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 61 transitions, 433 flow [2023-08-25 04:34:56,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 309.75) internal successors, (1239), 4 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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:56,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:34:56,805 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:34:56,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-25 04:34:57,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:34:57,010 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2023-08-25 04:34:57,010 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:34:57,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1851579249, now seen corresponding path program 1 times [2023-08-25 04:34:57,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:34:57,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23339176] [2023-08-25 04:34:57,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:34:57,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:34:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:34:57,490 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:34:57,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:34:57,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23339176] [2023-08-25 04:34:57,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23339176] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 04:34:57,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034047672] [2023-08-25 04:34:57,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:34:57,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:34:57,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:34:57,492 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:57,494 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:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:34:57,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-25 04:34:57,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 04:35:07,132 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:35:07,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 04:35:16,513 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:35:16,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034047672] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 04:35:16,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 04:35:16,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2023-08-25 04:35:16,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188148511] [2023-08-25 04:35:16,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 04:35:16,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-25 04:35:16,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:35:16,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-25 04:35:16,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=116, Unknown=5, NotChecked=0, Total=156 [2023-08-25 04:35:16,516 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 768 [2023-08-25 04:35:16,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 61 transitions, 433 flow. Second operand has 13 states, 13 states have (on average 297.2307692307692) internal successors, (3864), 13 states have internal predecessors, (3864), 0 states have call successors, (0), 0 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:16,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:35:16,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 768 [2023-08-25 04:35:16,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:35:19,191 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:35:21,854 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:23,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:35:25,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:35:28,481 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:30,502 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:32,537 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:37,017 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,025 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:41,042 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:43,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:35:48,394 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:50,586 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:56,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 04:36:02,674 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:36:05,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:36:07,209 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:36:09,828 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:36:11,832 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:36:15,317 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:36:17,331 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:36:19,527 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:36:21,805 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:36:23,810 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:36:25,838 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:36:27,884 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:36:31,423 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:36:33,695 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:36:36,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:36:37,133 INFO L124 PetriNetUnfolderBase]: 12271/16323 cut-off events. [2023-08-25 04:36:37,133 INFO L125 PetriNetUnfolderBase]: For 49392/49392 co-relation queries the response was YES. [2023-08-25 04:36:37,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69095 conditions, 16323 events. 12271/16323 cut-off events. For 49392/49392 co-relation queries the response was YES. Maximal size of possible extension queue 483. Compared 75662 event pairs, 2280 based on Foata normal form. 2/16325 useless extension candidates. Maximal degree in co-relation 69071. Up to 11456 conditions per place. [2023-08-25 04:36:37,229 INFO L140 encePairwiseOnDemand]: 761/768 looper letters, 180 selfloop transitions, 31 changer transitions 5/216 dead transitions. [2023-08-25 04:36:37,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 216 transitions, 1662 flow [2023-08-25 04:36:37,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 04:36:37,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 04:36:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2799 transitions. [2023-08-25 04:36:37,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4049479166666667 [2023-08-25 04:36:37,234 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2799 transitions. [2023-08-25 04:36:37,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2799 transitions. [2023-08-25 04:36:37,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:36:37,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2799 transitions. [2023-08-25 04:36:37,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 311.0) internal successors, (2799), 9 states have internal predecessors, (2799), 0 states have call successors, (0), 0 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:36:37,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 768.0) internal successors, (7680), 10 states have internal predecessors, (7680), 0 states have call successors, (0), 0 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:36:37,244 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 768.0) internal successors, (7680), 10 states have internal predecessors, (7680), 0 states have call successors, (0), 0 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:36:37,244 INFO L175 Difference]: Start difference. First operand has 76 places, 61 transitions, 433 flow. Second operand 9 states and 2799 transitions. [2023-08-25 04:36:37,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 216 transitions, 1662 flow [2023-08-25 04:36:37,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 216 transitions, 1637 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-25 04:36:37,344 INFO L231 Difference]: Finished difference. Result has 88 places, 87 transitions, 774 flow [2023-08-25 04:36:37,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=768, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=774, PETRI_PLACES=88, PETRI_TRANSITIONS=87} [2023-08-25 04:36:37,344 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -1 predicate places. [2023-08-25 04:36:37,345 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 87 transitions, 774 flow [2023-08-25 04:36:37,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 297.2307692307692) internal successors, (3864), 13 states have internal predecessors, (3864), 0 states have call successors, (0), 0 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:36:37,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:36:37,345 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:36:37,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-25 04:36:37,550 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,SelfDestructingSolverStorable11 [2023-08-25 04:36:37,551 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2023-08-25 04:36:37,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:36:37,551 INFO L85 PathProgramCache]: Analyzing trace with hash 13819365, now seen corresponding path program 1 times [2023-08-25 04:36:37,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:36:37,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499334438] [2023-08-25 04:36:37,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:36:37,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:36:37,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:36:37,976 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:36:37,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:36:37,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499334438] [2023-08-25 04:36:37,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499334438] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 04:36:37,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435469854] [2023-08-25 04:36:37,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:36:37,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:36:37,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:36:37,977 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:36:37,979 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:36:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:36:41,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-25 04:36:41,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 04:37:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:37:12,236 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 04:37:21,645 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:37:21,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435469854] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 04:37:21,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 04:37:21,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-25 04:37:21,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210340043] [2023-08-25 04:37:21,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 04:37:21,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-25 04:37:21,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:37:21,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-25 04:37:21,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=147, Unknown=10, NotChecked=0, Total=210 [2023-08-25 04:37:21,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 768 [2023-08-25 04:37:21,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 774 flow. Second operand has 15 states, 15 states have (on average 296.26666666666665) internal successors, (4444), 15 states have internal predecessors, (4444), 0 states have call successors, (0), 0 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:21,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:37:21,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 768 [2023-08-25 04:37:21,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:37:25,854 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:26,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 04:37:28,956 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:30,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:37:32,469 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:34,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:37:37,369 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:39,423 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:41,673 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:43,876 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,885 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:48,351 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:06,594 WARN L234 SmtUtils]: Spent 9.62s on a formula simplification. DAG size of input: 68 DAG size of output: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 04:38:08,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:38:11,939 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:14,674 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:23,468 WARN L234 SmtUtils]: Spent 6.83s on a formula simplification. DAG size of input: 58 DAG size of output: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 04:38:25,541 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,571 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,721 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:32,582 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,823 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,922 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:46,125 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:47,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:38:49,308 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:51,398 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,432 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:02,437 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:04,805 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:06,866 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:10,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:39:12,268 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:15,767 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,899 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:20,387 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:25,592 INFO L124 PetriNetUnfolderBase]: 21085/28244 cut-off events. [2023-08-25 04:39:25,592 INFO L125 PetriNetUnfolderBase]: For 92527/92527 co-relation queries the response was YES. [2023-08-25 04:39:25,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125764 conditions, 28244 events. 21085/28244 cut-off events. For 92527/92527 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 145455 event pairs, 1748 based on Foata normal form. 47/28291 useless extension candidates. Maximal degree in co-relation 125734. Up to 16764 conditions per place. [2023-08-25 04:39:25,736 INFO L140 encePairwiseOnDemand]: 757/768 looper letters, 332 selfloop transitions, 104 changer transitions 22/458 dead transitions. [2023-08-25 04:39:25,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 458 transitions, 3838 flow [2023-08-25 04:39:25,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-25 04:39:25,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-25 04:39:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 5292 transitions. [2023-08-25 04:39:25,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4053308823529412 [2023-08-25 04:39:25,745 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 5292 transitions. [2023-08-25 04:39:25,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 5292 transitions. [2023-08-25 04:39:25,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:39:25,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 5292 transitions. [2023-08-25 04:39:25,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 311.29411764705884) internal successors, (5292), 17 states have internal predecessors, (5292), 0 states have call successors, (0), 0 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:39:25,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 768.0) internal successors, (13824), 18 states have internal predecessors, (13824), 0 states have call successors, (0), 0 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:39:25,764 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 768.0) internal successors, (13824), 18 states have internal predecessors, (13824), 0 states have call successors, (0), 0 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:39:25,764 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 774 flow. Second operand 17 states and 5292 transitions. [2023-08-25 04:39:25,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 458 transitions, 3838 flow [2023-08-25 04:39:26,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 458 transitions, 3791 flow, removed 21 selfloop flow, removed 1 redundant places. [2023-08-25 04:39:26,010 INFO L231 Difference]: Finished difference. Result has 114 places, 189 transitions, 2096 flow [2023-08-25 04:39:26,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=768, PETRI_DIFFERENCE_MINUEND_FLOW=727, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2096, PETRI_PLACES=114, PETRI_TRANSITIONS=189} [2023-08-25 04:39:26,011 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, 25 predicate places. [2023-08-25 04:39:26,011 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 189 transitions, 2096 flow [2023-08-25 04:39:26,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 296.26666666666665) internal successors, (4444), 15 states have internal predecessors, (4444), 0 states have call successors, (0), 0 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:39:26,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:39:26,012 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:39:26,021 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:39:26,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:39:26,219 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2023-08-25 04:39:26,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:39:26,219 INFO L85 PathProgramCache]: Analyzing trace with hash -286687231, now seen corresponding path program 2 times [2023-08-25 04:39:26,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:39:26,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310639734] [2023-08-25 04:39:26,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:39:26,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:39:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:39:26,549 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:39:26,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:39:26,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310639734] [2023-08-25 04:39:26,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310639734] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 04:39:26,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090209732] [2023-08-25 04:39:26,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 04:39:26,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:39:26,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:39:26,550 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:39:26,604 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:39:28,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 04:39:28,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 04:39:28,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-25 04:39:28,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 04:40:01,542 WARN L234 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 04:40:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:40:13,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 04:40:19,374 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:40:19,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090209732] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 04:40:19,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 04:40:19,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 14 [2023-08-25 04:40:19,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221249917] [2023-08-25 04:40:19,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 04:40:19,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-25 04:40:19,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:40:19,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-25 04:40:19,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=156, Unknown=12, NotChecked=0, Total=240 [2023-08-25 04:40:19,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 768 [2023-08-25 04:40:19,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 189 transitions, 2096 flow. Second operand has 16 states, 16 states have (on average 296.0) internal successors, (4736), 16 states have internal predecessors, (4736), 0 states have call successors, (0), 0 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:19,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:40:19,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 768 [2023-08-25 04:40:19,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:40:32,460 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:34,863 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:39,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:40:42,318 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:40:44,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:40:46,741 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:50,058 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:54,208 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:55,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:40:57,452 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:00,589 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:02,597 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:04,602 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:06,607 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:08,645 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:14,389 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:16,452 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:27,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:41:30,258 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,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:41:33,751 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:41:35,988 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:37,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:41:39,850 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:41:41,863 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:43,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:41:46,108 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:48,643 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,836 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,352 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:00,155 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:02,298 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:04,305 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:06,313 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:08,318 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:10,462 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:12,471 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:15,591 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:17,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 04:42:20,852 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:23,023 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:24,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:42:27,427 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:29,447 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:42:30,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:42:32,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:42:33,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:42:35,976 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:39,338 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:41,503 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:43,511 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:45,862 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:46,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:42:48,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:42:51,947 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:54,427 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,419 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:42:57,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:43:03,987 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:43:06,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:43:12,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 04:43:14,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 04:43:16,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:43:18,320 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:20,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 04:43:23,480 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:43:25,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 04:43:28,639 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:31,603 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:31,717 INFO L124 PetriNetUnfolderBase]: 30750/41133 cut-off events. [2023-08-25 04:43:31,717 INFO L125 PetriNetUnfolderBase]: For 200765/200765 co-relation queries the response was YES. [2023-08-25 04:43:31,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200336 conditions, 41133 events. 30750/41133 cut-off events. For 200765/200765 co-relation queries the response was YES. Maximal size of possible extension queue 1190. Compared 220240 event pairs, 4038 based on Foata normal form. 112/41245 useless extension candidates. Maximal degree in co-relation 200294. Up to 27573 conditions per place. [2023-08-25 04:43:32,016 INFO L140 encePairwiseOnDemand]: 749/768 looper letters, 417 selfloop transitions, 128 changer transitions 39/584 dead transitions. [2023-08-25 04:43:32,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 584 transitions, 5922 flow [2023-08-25 04:43:32,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-25 04:43:32,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-25 04:43:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 5893 transitions. [2023-08-25 04:43:32,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4038514254385965 [2023-08-25 04:43:32,033 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 5893 transitions. [2023-08-25 04:43:32,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 5893 transitions. [2023-08-25 04:43:32,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:43:32,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 5893 transitions. [2023-08-25 04:43:32,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 310.1578947368421) internal successors, (5893), 19 states have internal predecessors, (5893), 0 states have call successors, (0), 0 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:43:32,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 768.0) internal successors, (15360), 20 states have internal predecessors, (15360), 0 states have call successors, (0), 0 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:43:32,050 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 768.0) internal successors, (15360), 20 states have internal predecessors, (15360), 0 states have call successors, (0), 0 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:43:32,050 INFO L175 Difference]: Start difference. First operand has 114 places, 189 transitions, 2096 flow. Second operand 19 states and 5893 transitions. [2023-08-25 04:43:32,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 584 transitions, 5922 flow [2023-08-25 04:43:33,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 584 transitions, 5595 flow, removed 161 selfloop flow, removed 1 redundant places. [2023-08-25 04:43:33,234 INFO L231 Difference]: Finished difference. Result has 143 places, 308 transitions, 3607 flow [2023-08-25 04:43:33,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=768, PETRI_DIFFERENCE_MINUEND_FLOW=1769, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3607, PETRI_PLACES=143, PETRI_TRANSITIONS=308} [2023-08-25 04:43:33,235 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, 54 predicate places. [2023-08-25 04:43:33,235 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 308 transitions, 3607 flow [2023-08-25 04:43:33,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 296.0) internal successors, (4736), 16 states have internal predecessors, (4736), 0 states have call successors, (0), 0 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:43:33,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:43:33,236 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:43:33,243 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:43:33,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:43:33,443 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2023-08-25 04:43:33,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:43:33,444 INFO L85 PathProgramCache]: Analyzing trace with hash 801718159, now seen corresponding path program 2 times [2023-08-25 04:43:33,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:43:33,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218557930] [2023-08-25 04:43:33,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:43:33,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:43:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:43:33,813 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:43:33,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:43:33,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218557930] [2023-08-25 04:43:33,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218557930] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 04:43:33,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096913848] [2023-08-25 04:43:33,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 04:43:33,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:43:33,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:43:33,817 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:43:33,819 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:43:34,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 04:43:34,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 04:43:34,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-25 04:43:34,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 04:43:34,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:43:34,763 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 04:43:35,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:43:35,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096913848] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 04:43:35,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 04:43:35,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2023-08-25 04:43:35,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537701710] [2023-08-25 04:43:35,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 04:43:35,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 04:43:35,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:43:35,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 04:43:35,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-25 04:43:35,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 768 [2023-08-25 04:43:35,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 308 transitions, 3607 flow. Second operand has 11 states, 11 states have (on average 299.09090909090907) internal successors, (3290), 11 states have internal predecessors, (3290), 0 states have call successors, (0), 0 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:43:35,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:43:35,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 768 [2023-08-25 04:43:35,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:43:41,630 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:45,477 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,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 04:43:50,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:43:55,962 INFO L124 PetriNetUnfolderBase]: 32524/43534 cut-off events. [2023-08-25 04:43:55,963 INFO L125 PetriNetUnfolderBase]: For 293773/293773 co-relation queries the response was YES. [2023-08-25 04:43:56,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249747 conditions, 43534 events. 32524/43534 cut-off events. For 293773/293773 co-relation queries the response was YES. Maximal size of possible extension queue 1294. Compared 236878 event pairs, 5463 based on Foata normal form. 1/43535 useless extension candidates. Maximal degree in co-relation 249692. Up to 39970 conditions per place. [2023-08-25 04:43:56,506 INFO L140 encePairwiseOnDemand]: 762/768 looper letters, 380 selfloop transitions, 18 changer transitions 6/404 dead transitions. [2023-08-25 04:43:56,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 404 transitions, 5091 flow [2023-08-25 04:43:56,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 04:43:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 04:43:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1873 transitions. [2023-08-25 04:43:56,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4064670138888889 [2023-08-25 04:43:56,512 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1873 transitions. [2023-08-25 04:43:56,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1873 transitions. [2023-08-25 04:43:56,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:43:56,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1873 transitions. [2023-08-25 04:43:56,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 312.1666666666667) internal successors, (1873), 6 states have internal predecessors, (1873), 0 states have call successors, (0), 0 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:43:56,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 768.0) internal successors, (5376), 7 states have internal predecessors, (5376), 0 states have call successors, (0), 0 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:43:56,533 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 768.0) internal successors, (5376), 7 states have internal predecessors, (5376), 0 states have call successors, (0), 0 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:43:56,533 INFO L175 Difference]: Start difference. First operand has 143 places, 308 transitions, 3607 flow. Second operand 6 states and 1873 transitions. [2023-08-25 04:43:56,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 404 transitions, 5091 flow [2023-08-25 04:43:58,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 404 transitions, 4596 flow, removed 245 selfloop flow, removed 1 redundant places. [2023-08-25 04:43:58,910 INFO L231 Difference]: Finished difference. Result has 149 places, 319 transitions, 3326 flow [2023-08-25 04:43:58,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=768, PETRI_DIFFERENCE_MINUEND_FLOW=3112, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3326, PETRI_PLACES=149, PETRI_TRANSITIONS=319} [2023-08-25 04:43:58,910 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, 60 predicate places. [2023-08-25 04:43:58,911 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 319 transitions, 3326 flow [2023-08-25 04:43:58,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 299.09090909090907) internal successors, (3290), 11 states have internal predecessors, (3290), 0 states have call successors, (0), 0 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:43:58,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:43:58,911 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:43:58,918 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:43:59,116 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,SelfDestructingSolverStorable14 [2023-08-25 04:43:59,118 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2023-08-25 04:43:59,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:43:59,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1601368272, now seen corresponding path program 3 times [2023-08-25 04:43:59,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:43:59,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157948537] [2023-08-25 04:43:59,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:43:59,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:43:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:43:59,235 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:43:59,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:43:59,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157948537] [2023-08-25 04:43:59,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157948537] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 04:43:59,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901906893] [2023-08-25 04:43:59,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 04:43:59,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:43:59,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:43:59,237 INFO L229 MonitoredProcess]: Starting monitored process 10 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:43:59,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-25 04:44:55,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-25 04:44:55,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 04:44:55,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-25 04:44:55,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 04:45:05,238 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:45:05,238 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 04:45:12,579 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:45:12,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901906893] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 04:45:12,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 04:45:12,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2023-08-25 04:45:12,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091476975] [2023-08-25 04:45:12,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 04:45:12,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-25 04:45:12,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:45:12,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-25 04:45:12,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=164, Unknown=3, NotChecked=0, Total=210 [2023-08-25 04:45:12,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 768 [2023-08-25 04:45:12,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 319 transitions, 3326 flow. Second operand has 15 states, 15 states have (on average 308.53333333333336) internal successors, (4628), 15 states have internal predecessors, (4628), 0 states have call successors, (0), 0 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:45:12,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:45:12,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 768 [2023-08-25 04:45:12,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:45:16,637 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:20,670 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:21,704 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:45:23,739 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:25,780 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:27,799 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:39,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:45:42,437 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:44,656 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:47,101 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:49,554 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:50,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:45:52,829 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:55,210 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:57,312 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:59,347 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,644 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:03,722 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:05,728 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:46:08,410 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:10,441 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:46:12,532 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:14,559 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:16,565 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:46:18,580 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:21,485 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:23,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:46:25,546 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:27,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:46:29,700 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:47:34,181 WARN L234 SmtUtils]: Spent 53.07s on a formula simplification. DAG size of input: 61 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 04:47:37,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:47:39,223 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:47:41,437 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:47:42,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:47:45,553 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:47:47,710 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:47:50,531 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:47:52,538 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:47:54,546 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:47:56,785 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:47:58,797 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:48:00,803 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:48:02,810 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:48:04,819 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:48:06,826 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:48:08,834 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:48:10,848 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:48:12,864 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:48:14,878 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:48:16,885 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:48:18,986 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:48:21,672 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:48:23,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:48:25,693 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:48:27,700 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:48:29,705 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:48:31,712 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:48:33,719 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:48:36,868 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:48:38,872 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:48:39,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:48:42,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:48:44,389 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:48:46,395 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:48:48,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:48:50,410 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:48:52,460 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:48:54,468 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:48:55,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 04:48:57,999 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:49:02,571 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:49:04,576 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:49:06,580 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 [] Received shutdown request... [2023-08-25 04:49:07,566 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:49:07,566 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 04:49:08,584 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:49:08,586 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONASSERT (87 of 88 remaining) [2023-08-25 04:49:08,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-25 04:49:08,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2023-08-25 04:49:08,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-25 04:49:08,787 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-25 04:49:08,788 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (86 of 88 remaining) [2023-08-25 04:49:08,788 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (85 of 88 remaining) [2023-08-25 04:49:08,788 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (84 of 88 remaining) [2023-08-25 04:49:08,788 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (83 of 88 remaining) [2023-08-25 04:49:08,788 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (82 of 88 remaining) [2023-08-25 04:49:08,788 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (81 of 88 remaining) [2023-08-25 04:49:08,788 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (80 of 88 remaining) [2023-08-25 04:49:08,788 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (79 of 88 remaining) [2023-08-25 04:49:08,788 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (78 of 88 remaining) [2023-08-25 04:49:08,788 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (77 of 88 remaining) [2023-08-25 04:49:08,788 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (76 of 88 remaining) [2023-08-25 04:49:08,788 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (75 of 88 remaining) [2023-08-25 04:49:08,788 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (74 of 88 remaining) [2023-08-25 04:49:08,789 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (73 of 88 remaining) [2023-08-25 04:49:08,789 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (72 of 88 remaining) [2023-08-25 04:49:08,789 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (71 of 88 remaining) [2023-08-25 04:49:08,789 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (70 of 88 remaining) [2023-08-25 04:49:08,789 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (69 of 88 remaining) [2023-08-25 04:49:08,789 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (68 of 88 remaining) [2023-08-25 04:49:08,789 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (67 of 88 remaining) [2023-08-25 04:49:08,789 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (66 of 88 remaining) [2023-08-25 04:49:08,789 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (65 of 88 remaining) [2023-08-25 04:49:08,789 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err6ASSERT_VIOLATIONDATA_RACE (64 of 88 remaining) [2023-08-25 04:49:08,789 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err7ASSERT_VIOLATIONDATA_RACE (63 of 88 remaining) [2023-08-25 04:49:08,789 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (62 of 88 remaining) [2023-08-25 04:49:08,789 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (61 of 88 remaining) [2023-08-25 04:49:08,789 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (60 of 88 remaining) [2023-08-25 04:49:08,789 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (59 of 88 remaining) [2023-08-25 04:49:08,789 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (58 of 88 remaining) [2023-08-25 04:49:08,789 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (57 of 88 remaining) [2023-08-25 04:49:08,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (56 of 88 remaining) [2023-08-25 04:49:08,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (55 of 88 remaining) [2023-08-25 04:49:08,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (54 of 88 remaining) [2023-08-25 04:49:08,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (53 of 88 remaining) [2023-08-25 04:49:08,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (52 of 88 remaining) [2023-08-25 04:49:08,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (51 of 88 remaining) [2023-08-25 04:49:08,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (50 of 88 remaining) [2023-08-25 04:49:08,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (49 of 88 remaining) [2023-08-25 04:49:08,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (48 of 88 remaining) [2023-08-25 04:49:08,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (47 of 88 remaining) [2023-08-25 04:49:08,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (46 of 88 remaining) [2023-08-25 04:49:08,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (45 of 88 remaining) [2023-08-25 04:49:08,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (44 of 88 remaining) [2023-08-25 04:49:08,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 88 remaining) [2023-08-25 04:49:08,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 88 remaining) [2023-08-25 04:49:08,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 88 remaining) [2023-08-25 04:49:08,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 88 remaining) [2023-08-25 04:49:08,790 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err0ASSERT_VIOLATIONDATA_RACE (39 of 88 remaining) [2023-08-25 04:49:08,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err1ASSERT_VIOLATIONDATA_RACE (38 of 88 remaining) [2023-08-25 04:49:08,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err2ASSERT_VIOLATIONDATA_RACE (37 of 88 remaining) [2023-08-25 04:49:08,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err3ASSERT_VIOLATIONDATA_RACE (36 of 88 remaining) [2023-08-25 04:49:08,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err4ASSERT_VIOLATIONDATA_RACE (35 of 88 remaining) [2023-08-25 04:49:08,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err5ASSERT_VIOLATIONDATA_RACE (34 of 88 remaining) [2023-08-25 04:49:08,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err6ASSERT_VIOLATIONDATA_RACE (33 of 88 remaining) [2023-08-25 04:49:08,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err7ASSERT_VIOLATIONDATA_RACE (32 of 88 remaining) [2023-08-25 04:49:08,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 88 remaining) [2023-08-25 04:49:08,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 88 remaining) [2023-08-25 04:49:08,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (29 of 88 remaining) [2023-08-25 04:49:08,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 88 remaining) [2023-08-25 04:49:08,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (27 of 88 remaining) [2023-08-25 04:49:08,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (26 of 88 remaining) [2023-08-25 04:49:08,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (25 of 88 remaining) [2023-08-25 04:49:08,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (24 of 88 remaining) [2023-08-25 04:49:08,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 88 remaining) [2023-08-25 04:49:08,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (22 of 88 remaining) [2023-08-25 04:49:08,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (21 of 88 remaining) [2023-08-25 04:49:08,791 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (20 of 88 remaining) [2023-08-25 04:49:08,792 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (19 of 88 remaining) [2023-08-25 04:49:08,792 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (18 of 88 remaining) [2023-08-25 04:49:08,792 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (17 of 88 remaining) [2023-08-25 04:49:08,792 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (16 of 88 remaining) [2023-08-25 04:49:08,792 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (15 of 88 remaining) [2023-08-25 04:49:08,792 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (14 of 88 remaining) [2023-08-25 04:49:08,792 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (13 of 88 remaining) [2023-08-25 04:49:08,792 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (12 of 88 remaining) [2023-08-25 04:49:08,792 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (11 of 88 remaining) [2023-08-25 04:49:08,792 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (10 of 88 remaining) [2023-08-25 04:49:08,792 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err6ASSERT_VIOLATIONDATA_RACE (9 of 88 remaining) [2023-08-25 04:49:08,792 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err7ASSERT_VIOLATIONDATA_RACE (8 of 88 remaining) [2023-08-25 04:49:08,792 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err0ASSERT_VIOLATIONDATA_RACE (7 of 88 remaining) [2023-08-25 04:49:08,792 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err1ASSERT_VIOLATIONDATA_RACE (6 of 88 remaining) [2023-08-25 04:49:08,792 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err2ASSERT_VIOLATIONDATA_RACE (5 of 88 remaining) [2023-08-25 04:49:08,792 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err3ASSERT_VIOLATIONDATA_RACE (4 of 88 remaining) [2023-08-25 04:49:08,792 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err4ASSERT_VIOLATIONDATA_RACE (3 of 88 remaining) [2023-08-25 04:49:08,792 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err5ASSERT_VIOLATIONDATA_RACE (2 of 88 remaining) [2023-08-25 04:49:08,793 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err6ASSERT_VIOLATIONDATA_RACE (1 of 88 remaining) [2023-08-25 04:49:08,793 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err7ASSERT_VIOLATIONDATA_RACE (0 of 88 remaining) [2023-08-25 04:49:08,793 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 1, 1, 1] [2023-08-25 04:49:08,799 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 04:49:08,799 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 04:49:08,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 04:49:08 BasicIcfg [2023-08-25 04:49:08,801 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 04:49:08,801 INFO L158 Benchmark]: Toolchain (without parser) took 868160.77ms. Allocated memory was 373.3MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 350.0MB in the beginning and 1.8GB in the end (delta: -1.4GB). Peak memory consumption was 626.7MB. Max. memory is 16.0GB. [2023-08-25 04:49:08,802 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 373.3MB. Free memory is still 349.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 04:49:08,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.78ms. Allocated memory is still 373.3MB. Free memory was 349.6MB in the beginning and 337.7MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-25 04:49:08,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.99ms. Allocated memory is still 373.3MB. Free memory was 337.7MB in the beginning and 335.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 04:49:08,803 INFO L158 Benchmark]: Boogie Preprocessor took 39.12ms. Allocated memory is still 373.3MB. Free memory was 335.3MB in the beginning and 333.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 04:49:08,803 INFO L158 Benchmark]: RCFGBuilder took 496.71ms. Allocated memory is still 373.3MB. Free memory was 333.2MB in the beginning and 308.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-25 04:49:08,803 INFO L158 Benchmark]: TraceAbstraction took 867356.68ms. Allocated memory was 373.3MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 307.3MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 584.7MB. Max. memory is 16.0GB. [2023-08-25 04:49:08,804 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.12ms. Allocated memory is still 373.3MB. Free memory is still 349.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 212.78ms. Allocated memory is still 373.3MB. Free memory was 349.6MB in the beginning and 337.7MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 48.99ms. Allocated memory is still 373.3MB. Free memory was 337.7MB in the beginning and 335.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.12ms. Allocated memory is still 373.3MB. Free memory was 335.3MB in the beginning and 333.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 496.71ms. Allocated memory is still 373.3MB. Free memory was 333.2MB in the beginning and 308.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 867356.68ms. Allocated memory was 373.3MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 307.3MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 584.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.9s, 321 PlacesBefore, 89 PlacesAfterwards, 322 TransitionsBefore, 84 TransitionsAfterwards, 23520 CoEnabledTransitionPairs, 8 FixpointIterations, 156 TrivialSequentialCompositions, 235 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 13 ConcurrentYvCompositions, 6 ChoiceCompositions, 429 TotalNumberOfCompositions, 39864 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 26427, independent: 26186, independent conditional: 0, independent unconditional: 26186, dependent: 241, dependent conditional: 0, dependent unconditional: 241, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 14370, independent: 14318, independent conditional: 0, independent unconditional: 14318, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 26427, independent: 11868, independent conditional: 0, independent unconditional: 11868, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 14370, unknown conditional: 0, unknown unconditional: 14370] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 305, Positive conditional cache size: 0, Positive unconditional cache size: 305, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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 executing Executor. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 40]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 40]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 40]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 56]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 56]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 77]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 79]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 466 locations, 88 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: 867.2s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 664.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 173 mSolverCounterUnknown, 1215 SdHoareTripleChecker+Valid, 485.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1215 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 482.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4609 IncrementalHoareTripleChecker+Invalid, 4882 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 0 mSDtfsCounter, 4609 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 586 GetRequests, 441 SyntacticMatches, 30 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 262.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3607occurred in iteration=14, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 61.6s SatisfiabilityAnalysisTime, 131.1s InterpolantComputationTime, 648 NumberOfCodeBlocks, 648 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 869 ConstructedInterpolants, 0 QuantifiedInterpolants, 28989 SizeOfPredicates, 24 NumberOfNonLiveVariables, 2619 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 34 InterpolantComputations, 7 PerfectInterpolantSequences, 15/104 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