/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 10:12:11,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 10:12:11,766 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 10:12:11,772 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 10:12:11,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 10:12:11,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 10:12:11,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 10:12:11,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 10:12:11,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 10:12:11,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 10:12:11,810 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 10:12:11,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 10:12:11,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 10:12:11,811 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 10:12:11,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 10:12:11,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 10:12:11,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 10:12:11,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 10:12:11,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 10:12:11,813 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 10:12:11,813 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 10:12:11,813 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 10:12:11,813 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 10:12:11,814 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 10:12:11,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 10:12:11,814 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 10:12:11,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 10:12:11,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 10:12:11,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 10:12:11,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 10:12:11,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 10:12:11,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 10:12:11,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 10:12:11,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 10:12:11,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 10:12:11,817 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-26 10:12:12,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 10:12:12,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 10:12:12,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 10:12:12,121 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 10:12:12,122 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 10:12:12,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2023-08-26 10:12:13,195 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 10:12:13,420 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 10:12:13,420 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2023-08-26 10:12:13,427 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bce7a8238/16bee057233a46b2acb5685b5852007c/FLAG230b99a71 [2023-08-26 10:12:13,438 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bce7a8238/16bee057233a46b2acb5685b5852007c [2023-08-26 10:12:13,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 10:12:13,442 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 10:12:13,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 10:12:13,443 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 10:12:13,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 10:12:13,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 10:12:13" (1/1) ... [2023-08-26 10:12:13,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e1b242 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:13, skipping insertion in model container [2023-08-26 10:12:13,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 10:12:13" (1/1) ... [2023-08-26 10:12:13,467 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 10:12:13,630 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 10:12:13,638 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 10:12:13,666 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 10:12:13,673 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 10:12:13,674 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 10:12:13,681 INFO L206 MainTranslator]: Completed translation [2023-08-26 10:12:13,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:13 WrapperNode [2023-08-26 10:12:13,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 10:12:13,682 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 10:12:13,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 10:12:13,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 10:12:13,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:13" (1/1) ... [2023-08-26 10:12:13,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:13" (1/1) ... [2023-08-26 10:12:13,759 INFO L138 Inliner]: procedures = 24, calls = 46, calls flagged for inlining = 12, calls inlined = 14, statements flattened = 428 [2023-08-26 10:12:13,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 10:12:13,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 10:12:13,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 10:12:13,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 10:12:13,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:13" (1/1) ... [2023-08-26 10:12:13,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:13" (1/1) ... [2023-08-26 10:12:13,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:13" (1/1) ... [2023-08-26 10:12:13,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:13" (1/1) ... [2023-08-26 10:12:13,799 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:13" (1/1) ... [2023-08-26 10:12:13,817 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:13" (1/1) ... [2023-08-26 10:12:13,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:13" (1/1) ... [2023-08-26 10:12:13,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:13" (1/1) ... [2023-08-26 10:12:13,823 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 10:12:13,824 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 10:12:13,824 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 10:12:13,824 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 10:12:13,825 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:13" (1/1) ... [2023-08-26 10:12:13,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 10:12:13,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:12:13,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 10:12:13,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 10:12:13,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 10:12:13,892 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 10:12:13,893 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 10:12:13,893 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 10:12:13,893 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 10:12:13,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 10:12:13,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 10:12:13,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 10:12:13,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 10:12:13,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 10:12:13,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-26 10:12:13,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 10:12:13,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 10:12:13,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 10:12:13,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 10:12:13,896 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 10:12:14,030 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 10:12:14,032 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 10:12:14,692 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 10:12:14,977 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 10:12:14,977 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-26 10:12:14,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 10:12:14 BoogieIcfgContainer [2023-08-26 10:12:14,980 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 10:12:14,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 10:12:14,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 10:12:14,985 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 10:12:14,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 10:12:13" (1/3) ... [2023-08-26 10:12:14,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8a4a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 10:12:14, skipping insertion in model container [2023-08-26 10:12:14,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:12:13" (2/3) ... [2023-08-26 10:12:14,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8a4a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 10:12:14, skipping insertion in model container [2023-08-26 10:12:14,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 10:12:14" (3/3) ... [2023-08-26 10:12:14,988 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2023-08-26 10:12:15,003 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 10:12:15,004 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2023-08-26 10:12:15,004 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 10:12:15,126 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 10:12:15,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 368 places, 377 transitions, 770 flow [2023-08-26 10:12:15,334 INFO L124 PetriNetUnfolderBase]: 16/375 cut-off events. [2023-08-26 10:12:15,334 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 10:12:15,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 375 events. 16/375 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 622 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 280. Up to 2 conditions per place. [2023-08-26 10:12:15,342 INFO L82 GeneralOperation]: Start removeDead. Operand has 368 places, 377 transitions, 770 flow [2023-08-26 10:12:15,375 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 357 places, 366 transitions, 744 flow [2023-08-26 10:12:15,379 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 10:12:15,390 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 357 places, 366 transitions, 744 flow [2023-08-26 10:12:15,394 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 357 places, 366 transitions, 744 flow [2023-08-26 10:12:15,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 357 places, 366 transitions, 744 flow [2023-08-26 10:12:15,458 INFO L124 PetriNetUnfolderBase]: 16/366 cut-off events. [2023-08-26 10:12:15,458 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 10:12:15,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 366 events. 16/366 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 621 event pairs, 0 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 280. Up to 2 conditions per place. [2023-08-26 10:12:15,469 INFO L119 LiptonReduction]: Number of co-enabled transitions 11388 [2023-08-26 10:12:28,959 INFO L134 LiptonReduction]: Checked pairs total: 60421 [2023-08-26 10:12:28,959 INFO L136 LiptonReduction]: Total number of compositions: 429 [2023-08-26 10:12:28,971 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 10:12:28,977 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;@7b40b84c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 10:12:28,977 INFO L358 AbstractCegarLoop]: Starting to check reachability of 120 error locations. [2023-08-26 10:12:28,978 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 10:12:28,978 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 10:12:28,978 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 10:12:28,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:12:28,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 10:12:28,979 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-26 10:12:28,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:12:28,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1773, now seen corresponding path program 1 times [2023-08-26 10:12:28,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:12:28,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707350845] [2023-08-26 10:12:28,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:12:28,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:12:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:12:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:12:29,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:12:29,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707350845] [2023-08-26 10:12:29,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707350845] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:12:29,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:12:29,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 10:12:29,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576476788] [2023-08-26 10:12:29,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:12:29,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 10:12:29,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:12:29,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 10:12:29,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 10:12:29,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 806 [2023-08-26 10:12:29,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 119 transitions, 250 flow. Second operand has 2 states, 2 states have (on average 325.5) internal successors, (651), 2 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:29,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:12:29,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 806 [2023-08-26 10:12:29,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:12:29,258 INFO L124 PetriNetUnfolderBase]: 133/441 cut-off events. [2023-08-26 10:12:29,259 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-26 10:12:29,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 441 events. 133/441 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2276 event pairs, 93 based on Foata normal form. 38/402 useless extension candidates. Maximal degree in co-relation 615. Up to 227 conditions per place. [2023-08-26 10:12:29,262 INFO L140 encePairwiseOnDemand]: 744/806 looper letters, 26 selfloop transitions, 0 changer transitions 0/57 dead transitions. [2023-08-26 10:12:29,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 178 flow [2023-08-26 10:12:29,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 10:12:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 10:12:29,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 738 transitions. [2023-08-26 10:12:29,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45781637717121587 [2023-08-26 10:12:29,281 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 738 transitions. [2023-08-26 10:12:29,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 738 transitions. [2023-08-26 10:12:29,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:12:29,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 738 transitions. [2023-08-26 10:12:29,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 369.0) internal successors, (738), 2 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:29,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 806.0) internal successors, (2418), 3 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:29,300 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 806.0) internal successors, (2418), 3 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:29,302 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 250 flow. Second operand 2 states and 738 transitions. [2023-08-26 10:12:29,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 178 flow [2023-08-26 10:12:29,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 57 transitions, 170 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 10:12:29,307 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 118 flow [2023-08-26 10:12:29,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=118, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2023-08-26 10:12:29,313 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -64 predicate places. [2023-08-26 10:12:29,313 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 118 flow [2023-08-26 10:12:29,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 325.5) internal successors, (651), 2 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:29,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:12:29,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 10:12:29,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 10:12:29,315 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-26 10:12:29,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:12:29,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1805276190, now seen corresponding path program 1 times [2023-08-26 10:12:29,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:12:29,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533154311] [2023-08-26 10:12:29,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:12:29,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:12:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:12:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:12:29,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:12:29,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533154311] [2023-08-26 10:12:29,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533154311] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:12:29,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:12:29,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 10:12:29,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003858940] [2023-08-26 10:12:29,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:12:29,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 10:12:29,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:12:29,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 10:12:29,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 10:12:29,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 806 [2023-08-26 10:12:29,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:29,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:12:29,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 806 [2023-08-26 10:12:29,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:12:29,648 INFO L124 PetriNetUnfolderBase]: 198/505 cut-off events. [2023-08-26 10:12:29,648 INFO L125 PetriNetUnfolderBase]: For 5/18 co-relation queries the response was YES. [2023-08-26 10:12:29,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 505 events. 198/505 cut-off events. For 5/18 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2297 event pairs, 69 based on Foata normal form. 1/448 useless extension candidates. Maximal degree in co-relation 855. Up to 311 conditions per place. [2023-08-26 10:12:29,651 INFO L140 encePairwiseOnDemand]: 799/806 looper letters, 34 selfloop transitions, 4 changer transitions 0/62 dead transitions. [2023-08-26 10:12:29,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 62 transitions, 205 flow [2023-08-26 10:12:29,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 10:12:29,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 10:12:29,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 989 transitions. [2023-08-26 10:12:29,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40901571546732834 [2023-08-26 10:12:29,655 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 989 transitions. [2023-08-26 10:12:29,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 989 transitions. [2023-08-26 10:12:29,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:12:29,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 989 transitions. [2023-08-26 10:12:29,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 329.6666666666667) internal successors, (989), 3 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:29,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:29,665 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:29,665 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 118 flow. Second operand 3 states and 989 transitions. [2023-08-26 10:12:29,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 62 transitions, 205 flow [2023-08-26 10:12:29,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 62 transitions, 205 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 10:12:29,667 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 136 flow [2023-08-26 10:12:29,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2023-08-26 10:12:29,668 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -64 predicate places. [2023-08-26 10:12:29,668 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 136 flow [2023-08-26 10:12:29,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:29,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:12:29,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:12:29,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 10:12:29,670 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-26 10:12:29,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:12:29,670 INFO L85 PathProgramCache]: Analyzing trace with hash -296328895, now seen corresponding path program 1 times [2023-08-26 10:12:29,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:12:29,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290120805] [2023-08-26 10:12:29,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:12:29,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:12:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:12:29,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:12:29,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:12:29,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290120805] [2023-08-26 10:12:29,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290120805] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:12:29,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:12:29,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 10:12:29,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023057980] [2023-08-26 10:12:29,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:12:29,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 10:12:29,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:12:29,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 10:12:29,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 10:12:29,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 806 [2023-08-26 10:12:29,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:29,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:12:29,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 806 [2023-08-26 10:12:29,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:12:29,821 INFO L124 PetriNetUnfolderBase]: 162/464 cut-off events. [2023-08-26 10:12:29,821 INFO L125 PetriNetUnfolderBase]: For 50/86 co-relation queries the response was YES. [2023-08-26 10:12:29,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 464 events. 162/464 cut-off events. For 50/86 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2185 event pairs, 115 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 819. Up to 268 conditions per place. [2023-08-26 10:12:29,823 INFO L140 encePairwiseOnDemand]: 804/806 looper letters, 28 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2023-08-26 10:12:29,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 56 transitions, 192 flow [2023-08-26 10:12:29,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 10:12:29,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 10:12:29,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 967 transitions. [2023-08-26 10:12:29,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3999172870140612 [2023-08-26 10:12:29,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 967 transitions. [2023-08-26 10:12:29,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 967 transitions. [2023-08-26 10:12:29,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:12:29,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 967 transitions. [2023-08-26 10:12:29,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:29,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:29,834 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:29,835 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 136 flow. Second operand 3 states and 967 transitions. [2023-08-26 10:12:29,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 56 transitions, 192 flow [2023-08-26 10:12:29,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 10:12:29,837 INFO L231 Difference]: Finished difference. Result has 56 places, 56 transitions, 132 flow [2023-08-26 10:12:29,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=56, PETRI_TRANSITIONS=56} [2023-08-26 10:12:29,838 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -64 predicate places. [2023-08-26 10:12:29,838 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 56 transitions, 132 flow [2023-08-26 10:12:29,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.0) internal successors, (945), 3 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:29,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:12:29,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:12:29,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 10:12:29,839 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-26 10:12:29,839 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:12:29,840 INFO L85 PathProgramCache]: Analyzing trace with hash -2117193164, now seen corresponding path program 1 times [2023-08-26 10:12:29,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:12:29,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241235188] [2023-08-26 10:12:29,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:12:29,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:12:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:12:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:12:30,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:12:30,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241235188] [2023-08-26 10:12:30,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241235188] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:12:30,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:12:30,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:12:30,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332437714] [2023-08-26 10:12:30,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:12:30,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:12:30,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:12:30,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:12:30,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:12:30,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 806 [2023-08-26 10:12:30,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 56 transitions, 132 flow. Second operand has 6 states, 6 states have (on average 278.8333333333333) internal successors, (1673), 6 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:30,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:12:30,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 806 [2023-08-26 10:12:30,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:12:30,895 INFO L124 PetriNetUnfolderBase]: 928/1508 cut-off events. [2023-08-26 10:12:30,895 INFO L125 PetriNetUnfolderBase]: For 254/254 co-relation queries the response was YES. [2023-08-26 10:12:30,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3273 conditions, 1508 events. 928/1508 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 6679 event pairs, 87 based on Foata normal form. 0/1270 useless extension candidates. Maximal degree in co-relation 3268. Up to 524 conditions per place. [2023-08-26 10:12:30,902 INFO L140 encePairwiseOnDemand]: 801/806 looper letters, 143 selfloop transitions, 4 changer transitions 0/155 dead transitions. [2023-08-26 10:12:30,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 155 transitions, 664 flow [2023-08-26 10:12:30,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:12:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:12:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1800 transitions. [2023-08-26 10:12:30,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37220843672456577 [2023-08-26 10:12:30,908 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1800 transitions. [2023-08-26 10:12:30,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1800 transitions. [2023-08-26 10:12:30,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:12:30,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1800 transitions. [2023-08-26 10:12:30,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 300.0) internal successors, (1800), 6 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:30,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:30,922 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:30,922 INFO L175 Difference]: Start difference. First operand has 56 places, 56 transitions, 132 flow. Second operand 6 states and 1800 transitions. [2023-08-26 10:12:30,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 155 transitions, 664 flow [2023-08-26 10:12:30,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 155 transitions, 663 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 10:12:30,926 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 137 flow [2023-08-26 10:12:30,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=137, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2023-08-26 10:12:30,926 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -61 predicate places. [2023-08-26 10:12:30,927 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 137 flow [2023-08-26 10:12:30,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 278.8333333333333) internal successors, (1673), 6 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:30,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:12:30,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:12:30,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 10:12:30,928 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-26 10:12:30,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:12:30,929 INFO L85 PathProgramCache]: Analyzing trace with hash -978371210, now seen corresponding path program 1 times [2023-08-26 10:12:30,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:12:30,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113714344] [2023-08-26 10:12:30,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:12:30,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:12:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:12:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:12:31,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:12:31,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113714344] [2023-08-26 10:12:31,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113714344] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:12:31,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:12:31,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 10:12:31,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970364402] [2023-08-26 10:12:31,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:12:31,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 10:12:31,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:12:31,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 10:12:31,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 10:12:31,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 806 [2023-08-26 10:12:31,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 270.4) internal successors, (1352), 5 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:31,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:12:31,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 806 [2023-08-26 10:12:31,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:12:31,225 INFO L124 PetriNetUnfolderBase]: 317/594 cut-off events. [2023-08-26 10:12:31,225 INFO L125 PetriNetUnfolderBase]: For 165/172 co-relation queries the response was YES. [2023-08-26 10:12:31,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 594 events. 317/594 cut-off events. For 165/172 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2161 event pairs, 229 based on Foata normal form. 1/500 useless extension candidates. Maximal degree in co-relation 1352. Up to 492 conditions per place. [2023-08-26 10:12:31,229 INFO L140 encePairwiseOnDemand]: 801/806 looper letters, 44 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2023-08-26 10:12:31,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 63 transitions, 256 flow [2023-08-26 10:12:31,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 10:12:31,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 10:12:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1387 transitions. [2023-08-26 10:12:31,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34416873449131513 [2023-08-26 10:12:31,233 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1387 transitions. [2023-08-26 10:12:31,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1387 transitions. [2023-08-26 10:12:31,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:12:31,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1387 transitions. [2023-08-26 10:12:31,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 277.4) internal successors, (1387), 5 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:31,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 806.0) internal successors, (4836), 6 states have internal predecessors, (4836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:31,245 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 806.0) internal successors, (4836), 6 states have internal predecessors, (4836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:31,245 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 137 flow. Second operand 5 states and 1387 transitions. [2023-08-26 10:12:31,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 63 transitions, 256 flow [2023-08-26 10:12:31,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 63 transitions, 247 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 10:12:31,247 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 146 flow [2023-08-26 10:12:31,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2023-08-26 10:12:31,248 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -60 predicate places. [2023-08-26 10:12:31,248 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 146 flow [2023-08-26 10:12:31,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 270.4) internal successors, (1352), 5 states have internal predecessors, (1352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:31,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:12:31,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:12:31,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 10:12:31,250 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-26 10:12:31,250 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:12:31,250 INFO L85 PathProgramCache]: Analyzing trace with hash -322824960, now seen corresponding path program 1 times [2023-08-26 10:12:31,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:12:31,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145090558] [2023-08-26 10:12:31,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:12:31,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:12:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:12:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:12:31,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:12:31,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145090558] [2023-08-26 10:12:31,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145090558] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:12:31,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:12:31,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:12:31,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975247232] [2023-08-26 10:12:31,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:12:31,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:12:31,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:12:31,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:12:31,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:12:31,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 806 [2023-08-26 10:12:31,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 277.1666666666667) internal successors, (1663), 6 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:31,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:12:31,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 806 [2023-08-26 10:12:31,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:12:31,979 INFO L124 PetriNetUnfolderBase]: 940/1525 cut-off events. [2023-08-26 10:12:31,979 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2023-08-26 10:12:31,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3414 conditions, 1525 events. 940/1525 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 6157 event pairs, 238 based on Foata normal form. 0/1357 useless extension candidates. Maximal degree in co-relation 3408. Up to 746 conditions per place. [2023-08-26 10:12:31,986 INFO L140 encePairwiseOnDemand]: 799/806 looper letters, 87 selfloop transitions, 5 changer transitions 0/98 dead transitions. [2023-08-26 10:12:31,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 98 transitions, 438 flow [2023-08-26 10:12:31,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:12:31,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:12:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1741 transitions. [2023-08-26 10:12:31,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36000827129859386 [2023-08-26 10:12:31,992 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1741 transitions. [2023-08-26 10:12:31,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1741 transitions. [2023-08-26 10:12:31,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:12:31,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1741 transitions. [2023-08-26 10:12:31,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 290.1666666666667) internal successors, (1741), 6 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:32,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:32,003 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:32,003 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 146 flow. Second operand 6 states and 1741 transitions. [2023-08-26 10:12:32,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 98 transitions, 438 flow [2023-08-26 10:12:32,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 98 transitions, 431 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 10:12:32,006 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 145 flow [2023-08-26 10:12:32,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=145, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2023-08-26 10:12:32,007 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -59 predicate places. [2023-08-26 10:12:32,007 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 145 flow [2023-08-26 10:12:32,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 277.1666666666667) internal successors, (1663), 6 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:32,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:12:32,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:12:32,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 10:12:32,008 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-26 10:12:32,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:12:32,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1079415241, now seen corresponding path program 1 times [2023-08-26 10:12:32,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:12:32,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486466344] [2023-08-26 10:12:32,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:12:32,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:12:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:12:32,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:12:32,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:12:32,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486466344] [2023-08-26 10:12:32,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486466344] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:12:32,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397962455] [2023-08-26 10:12:32,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:12:32,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:12:32,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:12:32,096 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 10:12:32,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 10:12:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:12:32,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 10:12:32,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:12:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:12:32,319 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:12:32,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:12:32,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397962455] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-26 10:12:32,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-26 10:12:32,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2023-08-26 10:12:32,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857764752] [2023-08-26 10:12:32,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:12:32,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 10:12:32,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:12:32,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 10:12:32,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-26 10:12:32,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 806 [2023-08-26 10:12:32,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 270.2) internal successors, (1351), 5 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:32,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:12:32,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 806 [2023-08-26 10:12:32,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:12:32,579 INFO L124 PetriNetUnfolderBase]: 536/1017 cut-off events. [2023-08-26 10:12:32,579 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2023-08-26 10:12:32,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2273 conditions, 1017 events. 536/1017 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3910 event pairs, 198 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 2267. Up to 423 conditions per place. [2023-08-26 10:12:32,585 INFO L140 encePairwiseOnDemand]: 800/806 looper letters, 66 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2023-08-26 10:12:32,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 379 flow [2023-08-26 10:12:32,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:12:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:12:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1678 transitions. [2023-08-26 10:12:32,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3469809760132341 [2023-08-26 10:12:32,590 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1678 transitions. [2023-08-26 10:12:32,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1678 transitions. [2023-08-26 10:12:32,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:12:32,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1678 transitions. [2023-08-26 10:12:32,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 279.6666666666667) internal successors, (1678), 6 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:32,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:32,601 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:32,601 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 145 flow. Second operand 6 states and 1678 transitions. [2023-08-26 10:12:32,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 379 flow [2023-08-26 10:12:32,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 87 transitions, 359 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-26 10:12:32,604 INFO L231 Difference]: Finished difference. Result has 63 places, 56 transitions, 163 flow [2023-08-26 10:12:32,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=63, PETRI_TRANSITIONS=56} [2023-08-26 10:12:32,605 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -57 predicate places. [2023-08-26 10:12:32,605 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 56 transitions, 163 flow [2023-08-26 10:12:32,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 270.2) internal successors, (1351), 5 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:32,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:12:32,606 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:12:32,622 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-26 10:12:32,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:12:32,819 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-26 10:12:32,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:12:32,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1896999279, now seen corresponding path program 1 times [2023-08-26 10:12:32,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:12:32,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258938945] [2023-08-26 10:12:32,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:12:32,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:12:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:12:33,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-26 10:12:33,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:12:33,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258938945] [2023-08-26 10:12:33,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258938945] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:12:33,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:12:33,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:12:33,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632949836] [2023-08-26 10:12:33,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:12:33,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:12:33,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:12:33,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:12:33,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:12:33,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 806 [2023-08-26 10:12:33,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 56 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 281.5) internal successors, (1689), 6 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:33,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:12:33,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 806 [2023-08-26 10:12:33,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:12:33,665 INFO L124 PetriNetUnfolderBase]: 1560/2705 cut-off events. [2023-08-26 10:12:33,665 INFO L125 PetriNetUnfolderBase]: For 621/621 co-relation queries the response was YES. [2023-08-26 10:12:33,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6015 conditions, 2705 events. 1560/2705 cut-off events. For 621/621 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 12478 event pairs, 1248 based on Foata normal form. 0/2437 useless extension candidates. Maximal degree in co-relation 6008. Up to 2384 conditions per place. [2023-08-26 10:12:33,682 INFO L140 encePairwiseOnDemand]: 801/806 looper letters, 59 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2023-08-26 10:12:33,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 71 transitions, 335 flow [2023-08-26 10:12:33,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:12:33,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:12:33,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1721 transitions. [2023-08-26 10:12:33,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35587262200165426 [2023-08-26 10:12:33,687 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1721 transitions. [2023-08-26 10:12:33,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1721 transitions. [2023-08-26 10:12:33,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:12:33,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1721 transitions. [2023-08-26 10:12:33,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 286.8333333333333) internal successors, (1721), 6 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:33,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:33,711 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 806.0) internal successors, (5642), 7 states have internal predecessors, (5642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:33,711 INFO L175 Difference]: Start difference. First operand has 63 places, 56 transitions, 163 flow. Second operand 6 states and 1721 transitions. [2023-08-26 10:12:33,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 71 transitions, 335 flow [2023-08-26 10:12:33,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 71 transitions, 331 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 10:12:33,713 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 165 flow [2023-08-26 10:12:33,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2023-08-26 10:12:33,714 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -55 predicate places. [2023-08-26 10:12:33,714 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 165 flow [2023-08-26 10:12:33,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 281.5) internal successors, (1689), 6 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:33,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:12:33,715 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:12:33,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 10:12:33,715 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-26 10:12:33,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:12:33,716 INFO L85 PathProgramCache]: Analyzing trace with hash -815923960, now seen corresponding path program 1 times [2023-08-26 10:12:33,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:12:33,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602330971] [2023-08-26 10:12:33,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:12:33,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:12:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:12:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:12:33,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:12:33,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602330971] [2023-08-26 10:12:33,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602330971] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:12:33,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:12:33,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 10:12:33,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358303137] [2023-08-26 10:12:33,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:12:33,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 10:12:33,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:12:33,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 10:12:33,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 10:12:33,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 806 [2023-08-26 10:12:33,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 165 flow. Second operand has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:33,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:12:33,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 806 [2023-08-26 10:12:33,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:12:34,223 INFO L124 PetriNetUnfolderBase]: 760/1384 cut-off events. [2023-08-26 10:12:34,223 INFO L125 PetriNetUnfolderBase]: For 284/284 co-relation queries the response was YES. [2023-08-26 10:12:34,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3113 conditions, 1384 events. 760/1384 cut-off events. For 284/284 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5937 event pairs, 46 based on Foata normal form. 0/1265 useless extension candidates. Maximal degree in co-relation 3105. Up to 660 conditions per place. [2023-08-26 10:12:34,232 INFO L140 encePairwiseOnDemand]: 801/806 looper letters, 66 selfloop transitions, 11 changer transitions 0/91 dead transitions. [2023-08-26 10:12:34,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 91 transitions, 422 flow [2023-08-26 10:12:34,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 10:12:34,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 10:12:34,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1582 transitions. [2023-08-26 10:12:34,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3925558312655087 [2023-08-26 10:12:34,236 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1582 transitions. [2023-08-26 10:12:34,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1582 transitions. [2023-08-26 10:12:34,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:12:34,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1582 transitions. [2023-08-26 10:12:34,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 316.4) internal successors, (1582), 5 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:34,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 806.0) internal successors, (4836), 6 states have internal predecessors, (4836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:34,245 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 806.0) internal successors, (4836), 6 states have internal predecessors, (4836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:34,245 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 165 flow. Second operand 5 states and 1582 transitions. [2023-08-26 10:12:34,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 91 transitions, 422 flow [2023-08-26 10:12:34,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 413 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 10:12:34,249 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 244 flow [2023-08-26 10:12:34,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=244, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2023-08-26 10:12:34,250 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -52 predicate places. [2023-08-26 10:12:34,251 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 244 flow [2023-08-26 10:12:34,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:34,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:12:34,251 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:12:34,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 10:12:34,252 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-26 10:12:34,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:12:34,252 INFO L85 PathProgramCache]: Analyzing trace with hash -635856298, now seen corresponding path program 2 times [2023-08-26 10:12:34,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:12:34,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971470608] [2023-08-26 10:12:34,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:12:34,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:12:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:12:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-26 10:12:34,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:12:34,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971470608] [2023-08-26 10:12:34,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971470608] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:12:34,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:12:34,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 10:12:34,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921521364] [2023-08-26 10:12:34,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:12:34,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 10:12:34,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:12:34,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 10:12:34,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 10:12:34,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 320 out of 806 [2023-08-26 10:12:34,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:34,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:12:34,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 320 of 806 [2023-08-26 10:12:34,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:12:34,693 INFO L124 PetriNetUnfolderBase]: 523/1243 cut-off events. [2023-08-26 10:12:34,694 INFO L125 PetriNetUnfolderBase]: For 1028/1035 co-relation queries the response was YES. [2023-08-26 10:12:34,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2931 conditions, 1243 events. 523/1243 cut-off events. For 1028/1035 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6912 event pairs, 176 based on Foata normal form. 2/1185 useless extension candidates. Maximal degree in co-relation 2920. Up to 505 conditions per place. [2023-08-26 10:12:34,700 INFO L140 encePairwiseOnDemand]: 803/806 looper letters, 55 selfloop transitions, 2 changer transitions 1/82 dead transitions. [2023-08-26 10:12:34,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 82 transitions, 463 flow [2023-08-26 10:12:34,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 10:12:34,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 10:12:34,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1002 transitions. [2023-08-26 10:12:34,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4143920595533499 [2023-08-26 10:12:34,704 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1002 transitions. [2023-08-26 10:12:34,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1002 transitions. [2023-08-26 10:12:34,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:12:34,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1002 transitions. [2023-08-26 10:12:34,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:34,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:34,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:34,711 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 244 flow. Second operand 3 states and 1002 transitions. [2023-08-26 10:12:34,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 82 transitions, 463 flow [2023-08-26 10:12:34,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 82 transitions, 459 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-26 10:12:34,717 INFO L231 Difference]: Finished difference. Result has 71 places, 63 transitions, 252 flow [2023-08-26 10:12:34,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=71, PETRI_TRANSITIONS=63} [2023-08-26 10:12:34,718 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -49 predicate places. [2023-08-26 10:12:34,718 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 63 transitions, 252 flow [2023-08-26 10:12:34,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.3333333333333) internal successors, (979), 3 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:34,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:12:34,719 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:12:34,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 10:12:34,719 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-26 10:12:34,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:12:34,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1520055367, now seen corresponding path program 1 times [2023-08-26 10:12:34,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:12:34,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929046485] [2023-08-26 10:12:34,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:12:34,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:12:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:12:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-26 10:12:34,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:12:34,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929046485] [2023-08-26 10:12:34,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929046485] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:12:34,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:12:34,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 10:12:34,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318777600] [2023-08-26 10:12:34,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:12:34,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 10:12:34,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:12:34,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 10:12:34,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 10:12:34,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 806 [2023-08-26 10:12:34,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:34,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:12:34,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 806 [2023-08-26 10:12:34,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:12:35,041 INFO L124 PetriNetUnfolderBase]: 507/1376 cut-off events. [2023-08-26 10:12:35,041 INFO L125 PetriNetUnfolderBase]: For 1277/1285 co-relation queries the response was YES. [2023-08-26 10:12:35,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3312 conditions, 1376 events. 507/1376 cut-off events. For 1277/1285 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7935 event pairs, 184 based on Foata normal form. 52/1360 useless extension candidates. Maximal degree in co-relation 3299. Up to 616 conditions per place. [2023-08-26 10:12:35,050 INFO L140 encePairwiseOnDemand]: 803/806 looper letters, 54 selfloop transitions, 2 changer transitions 4/84 dead transitions. [2023-08-26 10:12:35,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 84 transitions, 483 flow [2023-08-26 10:12:35,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 10:12:35,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 10:12:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1005 transitions. [2023-08-26 10:12:35,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41563275434243174 [2023-08-26 10:12:35,054 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1005 transitions. [2023-08-26 10:12:35,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1005 transitions. [2023-08-26 10:12:35,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:12:35,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1005 transitions. [2023-08-26 10:12:35,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:35,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:35,060 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 806.0) internal successors, (3224), 4 states have internal predecessors, (3224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:35,060 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 252 flow. Second operand 3 states and 1005 transitions. [2023-08-26 10:12:35,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 84 transitions, 483 flow [2023-08-26 10:12:35,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 84 transitions, 481 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 10:12:35,065 INFO L231 Difference]: Finished difference. Result has 73 places, 64 transitions, 262 flow [2023-08-26 10:12:35,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=73, PETRI_TRANSITIONS=64} [2023-08-26 10:12:35,066 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -47 predicate places. [2023-08-26 10:12:35,066 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 262 flow [2023-08-26 10:12:35,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:35,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:12:35,067 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:12:35,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 10:12:35,067 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-26 10:12:35,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:12:35,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1734987576, now seen corresponding path program 1 times [2023-08-26 10:12:35,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:12:35,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985433769] [2023-08-26 10:12:35,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:12:35,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:12:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:12:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 10:12:35,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:12:35,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985433769] [2023-08-26 10:12:35,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985433769] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:12:35,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:12:35,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 10:12:35,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993447301] [2023-08-26 10:12:35,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:12:35,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 10:12:35,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:12:35,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 10:12:35,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 10:12:35,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 806 [2023-08-26 10:12:35,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 64 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:35,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:12:35,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 806 [2023-08-26 10:12:35,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:12:35,553 INFO L124 PetriNetUnfolderBase]: 638/1719 cut-off events. [2023-08-26 10:12:35,553 INFO L125 PetriNetUnfolderBase]: For 1672/1684 co-relation queries the response was YES. [2023-08-26 10:12:35,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4288 conditions, 1719 events. 638/1719 cut-off events. For 1672/1684 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 10471 event pairs, 481 based on Foata normal form. 20/1628 useless extension candidates. Maximal degree in co-relation 4274. Up to 876 conditions per place. [2023-08-26 10:12:35,563 INFO L140 encePairwiseOnDemand]: 801/806 looper letters, 39 selfloop transitions, 2 changer transitions 26/91 dead transitions. [2023-08-26 10:12:35,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 91 transitions, 534 flow [2023-08-26 10:12:35,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 10:12:35,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 10:12:35,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1477 transitions. [2023-08-26 10:12:35,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36650124069478907 [2023-08-26 10:12:35,568 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1477 transitions. [2023-08-26 10:12:35,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1477 transitions. [2023-08-26 10:12:35,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:12:35,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1477 transitions. [2023-08-26 10:12:35,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 295.4) internal successors, (1477), 5 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:35,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 806.0) internal successors, (4836), 6 states have internal predecessors, (4836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:35,578 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 806.0) internal successors, (4836), 6 states have internal predecessors, (4836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:35,578 INFO L175 Difference]: Start difference. First operand has 73 places, 64 transitions, 262 flow. Second operand 5 states and 1477 transitions. [2023-08-26 10:12:35,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 91 transitions, 534 flow [2023-08-26 10:12:35,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 91 transitions, 532 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 10:12:35,583 INFO L231 Difference]: Finished difference. Result has 79 places, 65 transitions, 276 flow [2023-08-26 10:12:35,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=79, PETRI_TRANSITIONS=65} [2023-08-26 10:12:35,585 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, -41 predicate places. [2023-08-26 10:12:35,585 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 65 transitions, 276 flow [2023-08-26 10:12:35,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:35,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:12:35,586 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:12:35,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 10:12:35,586 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-26 10:12:35,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:12:35,587 INFO L85 PathProgramCache]: Analyzing trace with hash -533027293, now seen corresponding path program 1 times [2023-08-26 10:12:35,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:12:35,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803424617] [2023-08-26 10:12:35,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:12:35,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:12:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:12:36,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:12:36,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:12:36,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803424617] [2023-08-26 10:12:36,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803424617] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:12:36,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194565005] [2023-08-26 10:12:36,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:12:36,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:12:36,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:12:36,994 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 10:12:37,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 10:12:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:12:37,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-26 10:12:37,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:12:38,024 INFO L322 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-08-26 10:12:38,025 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 19 [2023-08-26 10:12:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:12:38,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:12:38,389 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:12:38,389 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 224 [2023-08-26 10:12:39,196 INFO L322 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2023-08-26 10:12:39,197 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 109 [2023-08-26 10:12:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:12:39,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194565005] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:12:39,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:12:39,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 24 [2023-08-26 10:12:39,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199393120] [2023-08-26 10:12:39,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:12:39,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-26 10:12:39,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:12:39,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-26 10:12:39,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2023-08-26 10:12:39,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 806 [2023-08-26 10:12:39,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 65 transitions, 276 flow. Second operand has 26 states, 26 states have (on average 226.03846153846155) internal successors, (5877), 26 states have internal predecessors, (5877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:39,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:12:39,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 806 [2023-08-26 10:12:39,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:12:44,803 INFO L124 PetriNetUnfolderBase]: 4140/8000 cut-off events. [2023-08-26 10:12:44,803 INFO L125 PetriNetUnfolderBase]: For 8625/8664 co-relation queries the response was YES. [2023-08-26 10:12:44,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22368 conditions, 8000 events. 4140/8000 cut-off events. For 8625/8664 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 53303 event pairs, 205 based on Foata normal form. 16/7833 useless extension candidates. Maximal degree in co-relation 22351. Up to 1303 conditions per place. [2023-08-26 10:12:44,863 INFO L140 encePairwiseOnDemand]: 789/806 looper letters, 497 selfloop transitions, 112 changer transitions 37/660 dead transitions. [2023-08-26 10:12:44,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 660 transitions, 4000 flow [2023-08-26 10:12:44,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-26 10:12:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-26 10:12:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 8978 transitions. [2023-08-26 10:12:44,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2931304688520308 [2023-08-26 10:12:44,889 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 8978 transitions. [2023-08-26 10:12:44,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 8978 transitions. [2023-08-26 10:12:44,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:12:44,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 8978 transitions. [2023-08-26 10:12:44,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 236.26315789473685) internal successors, (8978), 38 states have internal predecessors, (8978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:44,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 806.0) internal successors, (31434), 39 states have internal predecessors, (31434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:44,955 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 806.0) internal successors, (31434), 39 states have internal predecessors, (31434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:44,955 INFO L175 Difference]: Start difference. First operand has 79 places, 65 transitions, 276 flow. Second operand 38 states and 8978 transitions. [2023-08-26 10:12:44,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 660 transitions, 4000 flow [2023-08-26 10:12:44,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 660 transitions, 3982 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-26 10:12:44,986 INFO L231 Difference]: Finished difference. Result has 135 places, 188 transitions, 1410 flow [2023-08-26 10:12:44,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=1410, PETRI_PLACES=135, PETRI_TRANSITIONS=188} [2023-08-26 10:12:44,988 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 15 predicate places. [2023-08-26 10:12:44,988 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 188 transitions, 1410 flow [2023-08-26 10:12:44,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 226.03846153846155) internal successors, (5877), 26 states have internal predecessors, (5877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:44,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:12:44,990 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:12:44,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 10:12:45,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-26 10:12:45,196 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-26 10:12:45,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:12:45,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1993479413, now seen corresponding path program 2 times [2023-08-26 10:12:45,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:12:45,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973893571] [2023-08-26 10:12:45,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:12:45,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:12:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:12:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:12:46,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:12:46,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973893571] [2023-08-26 10:12:46,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973893571] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:12:46,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659233296] [2023-08-26 10:12:46,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 10:12:46,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:12:46,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:12:46,635 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 10:12:46,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 10:12:46,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 10:12:46,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 10:12:46,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-26 10:12:46,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:12:47,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:12:47,290 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-26 10:12:47,608 INFO L322 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2023-08-26 10:12:47,608 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 19 [2023-08-26 10:12:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:12:47,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:12:51,099 INFO L322 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2023-08-26 10:12:51,100 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 266 treesize of output 259 [2023-08-26 10:12:51,142 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:12:51,142 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 182 treesize of output 193 [2023-08-26 10:12:51,169 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:12:51,169 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 145 [2023-08-26 10:12:53,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:12:53,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659233296] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:12:53,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:12:53,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 29 [2023-08-26 10:12:53,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684286256] [2023-08-26 10:12:53,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:12:53,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-26 10:12:53,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:12:53,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-26 10:12:53,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=773, Unknown=2, NotChecked=0, Total=930 [2023-08-26 10:12:53,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 806 [2023-08-26 10:12:53,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 188 transitions, 1410 flow. Second operand has 31 states, 31 states have (on average 209.48387096774192) internal successors, (6494), 31 states have internal predecessors, (6494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:12:53,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:12:53,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 806 [2023-08-26 10:12:53,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:13:10,434 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (not (= (mod c_~ok~0 256) 0))) (.cse4 (< c_~start~0 0)) (.cse5 (<= c_~n~0 c_~start~0))) (let ((.cse11 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse8 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse10 (+ c_~A~0.offset (* c_~i~0 4))) (.cse6 (and (<= c_~N~0 c_~i~0) (<= c_~end~0 c_~start~0))) (.cse14 (< |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) (.cse0 (<= c_~n~0 c_~end~0)) (.cse1 (< c_~end~0 0)) (.cse3 (= c_~start~0 c_~end~0)) (.cse2 (or .cse12 .cse4 .cse5))) (and (or .cse0 .cse1 (and .cse2 (or (and (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) .cse3 (< c_~v_old~0 (+ c_~last~0 1))) .cse4 .cse5))) (or .cse0 .cse1 .cse6 (and (or (forall ((v_ArrVal_843 (Array Int Int)) (~queue~0.base Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843))) (let ((.cse7 (select .cse9 ~queue~0.base))) (or (<= c_~v_old~0 (select .cse7 .cse8)) (not (= (select (select .cse9 c_~A~0.base) .cse10) (select .cse7 .cse11))))))) .cse4 .cse5) (or .cse12 .cse4 .cse5 (forall ((v_ArrVal_843 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843))) (= (select (select .cse13 c_~A~0.base) .cse10) (select (select .cse13 ~queue~0.base) .cse11))))))) .cse14) (= c_~ok~0 1) (or (= |c_thread2Thread1of1ForFork1_~cond~0#1| 0) (= |c_thread2Thread1of1ForFork1_~cond~0#1| 1)) (or .cse0 (let ((.cse15 (select (select |c_#memory_int| c_~A~0.base) .cse10))) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |c_#memory_int| ~queue~0.base) .cse11) .cse15))) .cse12 .cse4 .cse5) (or (forall ((~queue~0.base Int)) (let ((.cse16 (select |c_#memory_int| ~queue~0.base))) (or (not (= (select .cse16 .cse11) .cse15)) (<= c_~v_old~0 (select .cse16 .cse8))))) .cse4 .cse5))) .cse1 .cse6 .cse14) (or .cse0 .cse1 (and (or (and (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse3) .cse4 .cse5) .cse2))))) is different from false [2023-08-26 10:13:20,863 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (not (= (mod c_~ok~0 256) 0))) (.cse2 (< c_~start~0 0)) (.cse4 (<= c_~n~0 c_~start~0))) (let ((.cse11 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse8 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse10 (+ c_~A~0.offset (* c_~i~0 4))) (.cse14 (< |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) (.cse6 (and (<= c_~N~0 c_~i~0) (<= c_~end~0 c_~start~0))) (.cse0 (<= c_~n~0 c_~end~0)) (.cse1 (< c_~end~0 0)) (.cse3 (= c_~start~0 c_~end~0)) (.cse5 (or .cse12 .cse2 .cse4))) (and (or .cse0 .cse1 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or .cse2 (and (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t2~0#1.base| 1)) .cse3) .cse4) .cse5)) (or (< 0 (mod |c_thread2Thread1of1ForFork1_~cond~0#1| 256)) (not (= (* 256 (div c_~ok~0 256)) c_~ok~0))) (or .cse0 .cse1 .cse6 (and (or (forall ((v_ArrVal_843 (Array Int Int)) (~queue~0.base Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843))) (let ((.cse7 (select .cse9 ~queue~0.base))) (or (<= c_~v_old~0 (select .cse7 .cse8)) (not (= (select (select .cse9 c_~A~0.base) .cse10) (select .cse7 .cse11))))))) .cse2 .cse4) (or .cse12 .cse2 .cse4 (forall ((v_ArrVal_843 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843))) (= (select (select .cse13 c_~A~0.base) .cse10) (select (select .cse13 ~queue~0.base) .cse11))))))) .cse14) (or .cse0 (let ((.cse15 (select (select |c_#memory_int| c_~A~0.base) .cse10))) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |c_#memory_int| ~queue~0.base) .cse11) .cse15))) .cse12 .cse2 .cse4) (or (forall ((~queue~0.base Int)) (let ((.cse16 (select |c_#memory_int| ~queue~0.base))) (or (not (= (select .cse16 .cse11) .cse15)) (<= c_~v_old~0 (select .cse16 .cse8))))) .cse2 .cse4))) .cse1 .cse6 .cse14) (or .cse0 .cse1 .cse6 (and .cse5 (or (and (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) .cse3 (< c_~v_old~0 (+ c_~last~0 1))) .cse2 .cse4))) (or .cse0 .cse1 (and (or (and (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse3) .cse2 .cse4) .cse5))))) is different from false [2023-08-26 10:13:21,220 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (not (= (mod c_~ok~0 256) 0))) (.cse2 (< c_~start~0 0)) (.cse4 (<= c_~n~0 c_~start~0))) (let ((.cse11 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse8 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse10 (+ c_~A~0.offset (* c_~i~0 4))) (.cse6 (and (<= c_~N~0 c_~i~0) (<= c_~end~0 c_~start~0))) (.cse14 (< |c_thread1Thread1of1ForFork0_#t~mem1#1| c_~last~0)) (.cse0 (<= c_~n~0 c_~end~0)) (.cse1 (< c_~end~0 0)) (.cse3 (= c_~start~0 c_~end~0)) (.cse5 (or .cse12 .cse2 .cse4))) (and (or .cse0 .cse1 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (or .cse2 (and (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t2~0#1.base| 1)) .cse3) .cse4) .cse5)) (or .cse0 .cse1 (and .cse5 (or (and (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) .cse3 (< c_~v_old~0 (+ c_~last~0 1))) .cse2 .cse4))) (or (< 0 (mod |c_thread2Thread1of1ForFork1_~cond~0#1| 256)) (not (= (* 256 (div c_~ok~0 256)) c_~ok~0))) (or .cse0 .cse1 .cse6 (and (or (forall ((v_ArrVal_843 (Array Int Int)) (~queue~0.base Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843))) (let ((.cse7 (select .cse9 ~queue~0.base))) (or (<= c_~v_old~0 (select .cse7 .cse8)) (not (= (select (select .cse9 c_~A~0.base) .cse10) (select .cse7 .cse11))))))) .cse2 .cse4) (or .cse12 .cse2 .cse4 (forall ((v_ArrVal_843 (Array Int Int)) (~queue~0.base Int)) (not (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_843))) (= (select (select .cse13 c_~A~0.base) .cse10) (select (select .cse13 ~queue~0.base) .cse11))))))) .cse14) (or .cse0 (let ((.cse15 (select (select |c_#memory_int| c_~A~0.base) .cse10))) (and (or (forall ((~queue~0.base Int)) (not (= (select (select |c_#memory_int| ~queue~0.base) .cse11) .cse15))) .cse12 .cse2 .cse4) (or (forall ((~queue~0.base Int)) (let ((.cse16 (select |c_#memory_int| ~queue~0.base))) (or (not (= (select .cse16 .cse11) .cse15)) (<= c_~v_old~0 (select .cse16 .cse8))))) .cse2 .cse4))) .cse1 .cse6 .cse14) (or .cse0 .cse1 (and (or (and (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse3) .cse2 .cse4) .cse5))))) is different from false [2023-08-26 10:13:28,164 INFO L124 PetriNetUnfolderBase]: 10424/20455 cut-off events. [2023-08-26 10:13:28,164 INFO L125 PetriNetUnfolderBase]: For 61484/61604 co-relation queries the response was YES. [2023-08-26 10:13:28,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73299 conditions, 20455 events. 10424/20455 cut-off events. For 61484/61604 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 155645 event pairs, 510 based on Foata normal form. 65/20492 useless extension candidates. Maximal degree in co-relation 73260. Up to 3243 conditions per place. [2023-08-26 10:13:28,335 INFO L140 encePairwiseOnDemand]: 785/806 looper letters, 944 selfloop transitions, 452 changer transitions 464/1870 dead transitions. [2023-08-26 10:13:28,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 1870 transitions, 13863 flow [2023-08-26 10:13:28,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2023-08-26 10:13:28,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2023-08-26 10:13:28,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 27803 transitions. [2023-08-26 10:13:28,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2694924782878412 [2023-08-26 10:13:28,377 INFO L72 ComplementDD]: Start complementDD. Operand 128 states and 27803 transitions. [2023-08-26 10:13:28,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 27803 transitions. [2023-08-26 10:13:28,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:13:28,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 128 states and 27803 transitions. [2023-08-26 10:13:28,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 129 states, 128 states have (on average 217.2109375) internal successors, (27803), 128 states have internal predecessors, (27803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:13:28,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 129 states, 129 states have (on average 806.0) internal successors, (103974), 129 states have internal predecessors, (103974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:13:28,531 INFO L81 ComplementDD]: Finished complementDD. Result has 129 states, 129 states have (on average 806.0) internal successors, (103974), 129 states have internal predecessors, (103974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:13:28,531 INFO L175 Difference]: Start difference. First operand has 135 places, 188 transitions, 1410 flow. Second operand 128 states and 27803 transitions. [2023-08-26 10:13:28,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 1870 transitions, 13863 flow [2023-08-26 10:13:28,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 1870 transitions, 13491 flow, removed 138 selfloop flow, removed 5 redundant places. [2023-08-26 10:13:28,942 INFO L231 Difference]: Finished difference. Result has 321 places, 575 transitions, 6305 flow [2023-08-26 10:13:28,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=128, PETRI_FLOW=6305, PETRI_PLACES=321, PETRI_TRANSITIONS=575} [2023-08-26 10:13:28,943 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 201 predicate places. [2023-08-26 10:13:28,943 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 575 transitions, 6305 flow [2023-08-26 10:13:28,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 209.48387096774192) internal successors, (6494), 31 states have internal predecessors, (6494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:13:28,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:13:28,945 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:13:28,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 10:13:29,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:13:29,149 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-26 10:13:29,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:13:29,149 INFO L85 PathProgramCache]: Analyzing trace with hash 930689911, now seen corresponding path program 3 times [2023-08-26 10:13:29,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:13:29,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531937393] [2023-08-26 10:13:29,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:13:29,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:13:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:13:30,626 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:13:30,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:13:30,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531937393] [2023-08-26 10:13:30,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531937393] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:13:30,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952983225] [2023-08-26 10:13:30,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 10:13:30,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:13:30,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:13:30,629 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 10:13:30,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 10:13:30,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 10:13:30,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 10:13:30,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-26 10:13:30,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:13:31,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:13:31,558 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-26 10:13:31,558 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 42 [2023-08-26 10:13:31,568 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-08-26 10:13:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:13:31,787 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:13:32,062 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:13:32,062 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 224 [2023-08-26 10:13:32,943 INFO L322 Elim1Store]: treesize reduction 19, result has 59.6 percent of original size [2023-08-26 10:13:32,944 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 77 [2023-08-26 10:13:32,954 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2023-08-26 10:13:33,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:13:33,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952983225] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:13:33,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:13:33,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 26 [2023-08-26 10:13:33,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165426537] [2023-08-26 10:13:33,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:13:33,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-26 10:13:33,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:13:33,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-26 10:13:33,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2023-08-26 10:13:33,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 806 [2023-08-26 10:13:33,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 575 transitions, 6305 flow. Second operand has 28 states, 28 states have (on average 216.17857142857142) internal successors, (6053), 28 states have internal predecessors, (6053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:13:33,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:13:33,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 806 [2023-08-26 10:13:33,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:13:37,041 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 [0] [2023-08-26 10:13:41,095 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 [0] [2023-08-26 10:13:51,361 INFO L124 PetriNetUnfolderBase]: 16105/30622 cut-off events. [2023-08-26 10:13:51,362 INFO L125 PetriNetUnfolderBase]: For 577636/577872 co-relation queries the response was YES. [2023-08-26 10:13:51,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174076 conditions, 30622 events. 16105/30622 cut-off events. For 577636/577872 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 238658 event pairs, 1731 based on Foata normal form. 122/30663 useless extension candidates. Maximal degree in co-relation 173974. Up to 5875 conditions per place. [2023-08-26 10:13:51,890 INFO L140 encePairwiseOnDemand]: 790/806 looper letters, 1019 selfloop transitions, 468 changer transitions 105/1602 dead transitions. [2023-08-26 10:13:51,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 1602 transitions, 21356 flow [2023-08-26 10:13:51,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-08-26 10:13:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-08-26 10:13:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 10275 transitions. [2023-08-26 10:13:51,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28329197684036395 [2023-08-26 10:13:51,912 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 10275 transitions. [2023-08-26 10:13:51,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 10275 transitions. [2023-08-26 10:13:51,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:13:51,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 10275 transitions. [2023-08-26 10:13:51,939 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 228.33333333333334) internal successors, (10275), 45 states have internal predecessors, (10275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:13:51,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 806.0) internal successors, (37076), 46 states have internal predecessors, (37076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:13:51,976 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 806.0) internal successors, (37076), 46 states have internal predecessors, (37076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:13:51,976 INFO L175 Difference]: Start difference. First operand has 321 places, 575 transitions, 6305 flow. Second operand 45 states and 10275 transitions. [2023-08-26 10:13:51,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 1602 transitions, 21356 flow [2023-08-26 10:13:54,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 1602 transitions, 19868 flow, removed 728 selfloop flow, removed 20 redundant places. [2023-08-26 10:13:54,650 INFO L231 Difference]: Finished difference. Result has 334 places, 852 transitions, 11357 flow [2023-08-26 10:13:54,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=5797, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=11357, PETRI_PLACES=334, PETRI_TRANSITIONS=852} [2023-08-26 10:13:54,651 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 214 predicate places. [2023-08-26 10:13:54,651 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 852 transitions, 11357 flow [2023-08-26 10:13:54,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 216.17857142857142) internal successors, (6053), 28 states have internal predecessors, (6053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:13:54,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:13:54,652 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:13:54,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 10:13:54,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-26 10:13:54,854 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-26 10:13:54,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:13:54,855 INFO L85 PathProgramCache]: Analyzing trace with hash -551202068, now seen corresponding path program 4 times [2023-08-26 10:13:54,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:13:54,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618092469] [2023-08-26 10:13:54,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:13:54,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:13:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:13:55,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 10:13:55,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:13:55,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618092469] [2023-08-26 10:13:55,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618092469] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:13:55,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:13:55,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 10:13:55,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749070750] [2023-08-26 10:13:55,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:13:55,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 10:13:55,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:13:55,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 10:13:55,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 10:13:55,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 806 [2023-08-26 10:13:55,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 852 transitions, 11357 flow. Second operand has 4 states, 4 states have (on average 327.75) internal successors, (1311), 4 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:13:55,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:13:55,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 806 [2023-08-26 10:13:55,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:14:02,694 INFO L124 PetriNetUnfolderBase]: 10114/26452 cut-off events. [2023-08-26 10:14:02,694 INFO L125 PetriNetUnfolderBase]: For 787624/789574 co-relation queries the response was YES. [2023-08-26 10:14:03,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161799 conditions, 26452 events. 10114/26452 cut-off events. For 787624/789574 co-relation queries the response was YES. Maximal size of possible extension queue 641. Compared 266279 event pairs, 2546 based on Foata normal form. 602/26471 useless extension candidates. Maximal degree in co-relation 161687. Up to 9204 conditions per place. [2023-08-26 10:14:03,182 INFO L140 encePairwiseOnDemand]: 803/806 looper letters, 797 selfloop transitions, 88 changer transitions 54/989 dead transitions. [2023-08-26 10:14:03,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 989 transitions, 15140 flow [2023-08-26 10:14:03,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 10:14:03,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 10:14:03,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1350 transitions. [2023-08-26 10:14:03,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41873449131513646 [2023-08-26 10:14:03,184 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1350 transitions. [2023-08-26 10:14:03,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1350 transitions. [2023-08-26 10:14:03,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:14:03,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1350 transitions. [2023-08-26 10:14:03,187 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 337.5) internal successors, (1350), 4 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:14:03,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 806.0) internal successors, (4030), 5 states have internal predecessors, (4030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:14:03,189 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 806.0) internal successors, (4030), 5 states have internal predecessors, (4030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:14:03,189 INFO L175 Difference]: Start difference. First operand has 334 places, 852 transitions, 11357 flow. Second operand 4 states and 1350 transitions. [2023-08-26 10:14:03,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 989 transitions, 15140 flow [2023-08-26 10:14:05,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 989 transitions, 14504 flow, removed 267 selfloop flow, removed 11 redundant places. [2023-08-26 10:14:05,579 INFO L231 Difference]: Finished difference. Result has 328 places, 797 transitions, 10384 flow [2023-08-26 10:14:05,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=10180, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=808, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=10384, PETRI_PLACES=328, PETRI_TRANSITIONS=797} [2023-08-26 10:14:05,580 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 208 predicate places. [2023-08-26 10:14:05,580 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 797 transitions, 10384 flow [2023-08-26 10:14:05,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 327.75) internal successors, (1311), 4 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:14:05,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:14:05,580 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:14:05,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 10:14:05,581 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-26 10:14:05,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:14:05,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2081433742, now seen corresponding path program 5 times [2023-08-26 10:14:05,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:14:05,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990924915] [2023-08-26 10:14:05,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:14:05,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:14:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:14:08,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:14:08,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:14:08,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990924915] [2023-08-26 10:14:08,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990924915] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:14:08,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812348851] [2023-08-26 10:14:08,900 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-26 10:14:08,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:14:08,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:14:08,904 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 10:14:08,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 10:14:09,618 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 10:14:09,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 10:14:09,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-26 10:14:09,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:14:09,754 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 10:14:09,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:14:09,831 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-26 10:14:10,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:14:10,187 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-26 10:14:10,441 INFO L322 Elim1Store]: treesize reduction 40, result has 7.0 percent of original size [2023-08-26 10:14:10,441 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 22 [2023-08-26 10:14:10,499 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 10:14:10,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:14:10,784 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:14:10,784 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 224 [2023-08-26 10:14:15,798 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:14:15,798 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 45 [2023-08-26 10:14:15,810 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:14:15,811 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 854 treesize of output 746 [2023-08-26 10:14:15,826 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:14:15,827 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 358 treesize of output 327 [2023-08-26 10:14:15,844 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:14:15,844 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 310 treesize of output 231 [2023-08-26 10:14:15,934 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:14:15,935 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 74 [2023-08-26 10:14:15,947 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:14:15,947 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 547 treesize of output 535 [2023-08-26 10:14:16,004 INFO L322 Elim1Store]: treesize reduction 24, result has 65.2 percent of original size [2023-08-26 10:14:16,005 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 667 treesize of output 672 [2023-08-26 10:14:16,045 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:14:16,046 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 652 treesize of output 560 [2023-08-26 10:14:16,083 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:14:16,084 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 449 treesize of output 423 [2023-08-26 10:14:20,505 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-08-26 10:14:20,531 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-08-26 10:14:20,561 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:14:20,561 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2023-08-26 10:14:20,598 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-08-26 10:14:20,624 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-08-26 10:14:20,645 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:14:20,646 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2023-08-26 10:14:20,813 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-26 10:14:20,813 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 1 [2023-08-26 10:14:20,822 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-26 10:14:20,822 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 1 [2023-08-26 10:14:20,829 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-26 10:14:20,830 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2023-08-26 10:14:20,878 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:14:20,878 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 125 [2023-08-26 10:14:20,881 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-26 10:14:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 10:14:21,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812348851] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:14:21,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:14:21,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 28 [2023-08-26 10:14:21,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351671125] [2023-08-26 10:14:21,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:14:21,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-26 10:14:21,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:14:21,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-26 10:14:21,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=701, Unknown=8, NotChecked=0, Total=870 [2023-08-26 10:14:21,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 806 [2023-08-26 10:14:21,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 797 transitions, 10384 flow. Second operand has 30 states, 30 states have (on average 203.33333333333334) internal successors, (6100), 30 states have internal predecessors, (6100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:14:21,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:14:21,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 806 [2023-08-26 10:14:21,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:14:25,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 10:15:16,382 INFO L124 PetriNetUnfolderBase]: 96596/164858 cut-off events. [2023-08-26 10:15:16,382 INFO L125 PetriNetUnfolderBase]: For 3576651/3577665 co-relation queries the response was YES. [2023-08-26 10:15:19,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951264 conditions, 164858 events. 96596/164858 cut-off events. For 3576651/3577665 co-relation queries the response was YES. Maximal size of possible extension queue 2002. Compared 1431452 event pairs, 10004 based on Foata normal form. 378/164795 useless extension candidates. Maximal degree in co-relation 951149. Up to 50816 conditions per place. [2023-08-26 10:15:20,753 INFO L140 encePairwiseOnDemand]: 791/806 looper letters, 1106 selfloop transitions, 429 changer transitions 65/1606 dead transitions. [2023-08-26 10:15:20,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 1606 transitions, 22731 flow [2023-08-26 10:15:20,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-26 10:15:20,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-26 10:15:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 5988 transitions. [2023-08-26 10:15:20,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26533144275079756 [2023-08-26 10:15:20,764 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 5988 transitions. [2023-08-26 10:15:20,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 5988 transitions. [2023-08-26 10:15:20,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:15:20,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 5988 transitions. [2023-08-26 10:15:20,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 213.85714285714286) internal successors, (5988), 28 states have internal predecessors, (5988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:15:20,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 806.0) internal successors, (23374), 29 states have internal predecessors, (23374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:15:20,789 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 806.0) internal successors, (23374), 29 states have internal predecessors, (23374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:15:20,789 INFO L175 Difference]: Start difference. First operand has 328 places, 797 transitions, 10384 flow. Second operand 28 states and 5988 transitions. [2023-08-26 10:15:20,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 1606 transitions, 22731 flow [2023-08-26 10:16:11,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 1606 transitions, 22709 flow, removed 11 selfloop flow, removed 0 redundant places. [2023-08-26 10:16:11,142 INFO L231 Difference]: Finished difference. Result has 360 places, 1085 transitions, 16297 flow [2023-08-26 10:16:11,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=806, PETRI_DIFFERENCE_MINUEND_FLOW=10378, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=797, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=16297, PETRI_PLACES=360, PETRI_TRANSITIONS=1085} [2023-08-26 10:16:11,143 INFO L281 CegarLoopForPetriNet]: 120 programPoint places, 240 predicate places. [2023-08-26 10:16:11,143 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 1085 transitions, 16297 flow [2023-08-26 10:16:11,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 203.33333333333334) internal successors, (6100), 30 states have internal predecessors, (6100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:16:11,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:16:11,145 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:16:11,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 10:16:11,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-26 10:16:11,351 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 116 more)] === [2023-08-26 10:16:11,352 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:16:11,352 INFO L85 PathProgramCache]: Analyzing trace with hash 145415460, now seen corresponding path program 6 times [2023-08-26 10:16:11,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:16:11,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828914860] [2023-08-26 10:16:11,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:16:11,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:16:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:16:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:16:14,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:16:14,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828914860] [2023-08-26 10:16:14,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828914860] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:16:14,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244310848] [2023-08-26 10:16:14,354 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-26 10:16:14,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:16:14,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:16:14,355 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 10:16:14,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 10:16:14,737 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-26 10:16:14,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 10:16:14,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 53 conjunts are in the unsatisfiable core [2023-08-26 10:16:14,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:16:14,980 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 10:16:15,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:16:15,040 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-26 10:16:15,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:16:15,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:16:15,447 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-26 10:16:15,447 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2023-08-26 10:16:15,815 INFO L322 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-08-26 10:16:15,815 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 19 [2023-08-26 10:16:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 10:16:15,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:16:17,230 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:16:17,231 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2023-08-26 10:16:17,242 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:16:17,242 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 90 [2023-08-26 10:16:17,255 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:16:17,255 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 63 [2023-08-26 10:16:17,304 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:16:17,305 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 68 [2023-08-26 10:16:17,317 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:16:17,317 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 349 treesize of output 343 [2023-08-26 10:16:17,363 INFO L322 Elim1Store]: treesize reduction 24, result has 65.2 percent of original size [2023-08-26 10:16:17,364 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 315 treesize of output 332 [2023-08-26 10:16:17,399 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:16:17,400 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 218 treesize of output 216 [2023-08-26 10:16:17,414 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 58 [2023-08-26 10:16:19,347 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:16:19,348 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2023-08-26 10:16:19,389 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 10:16:19,389 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 22 [2023-08-26 10:16:19,405 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-08-26 10:16:19,424 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-26 10:16:19,424 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1 [2023-08-26 10:16:19,441 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-08-26 10:16:36,544 WARN L234 SmtUtils]: Spent 17.06s on a formula simplification that was a NOOP. DAG size: 1239 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-08-26 10:16:36,545 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:16:36,546 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 25 select indices, 25 select index equivalence classes, 0 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 300 case distinctions, treesize of input 611 treesize of output 3973 [2023-08-26 10:16:37,089 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. Received shutdown request... [2023-08-26 10:25:37,323 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONASSERT (119 of 120 remaining) [2023-08-26 10:25:37,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 10:25:37,333 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 10:25:37,335 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 10:25:37,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-26 10:25:37,531 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. [2023-08-26 10:25:37,533 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (118 of 120 remaining) [2023-08-26 10:25:37,533 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (117 of 120 remaining) [2023-08-26 10:25:37,533 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (116 of 120 remaining) [2023-08-26 10:25:37,534 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (115 of 120 remaining) [2023-08-26 10:25:37,534 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (114 of 120 remaining) [2023-08-26 10:25:37,534 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (113 of 120 remaining) [2023-08-26 10:25:37,534 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (112 of 120 remaining) [2023-08-26 10:25:37,534 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (111 of 120 remaining) [2023-08-26 10:25:37,534 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONDATA_RACE (110 of 120 remaining) [2023-08-26 10:25:37,535 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONDATA_RACE (109 of 120 remaining) [2023-08-26 10:25:37,535 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err10ASSERT_VIOLATIONDATA_RACE (108 of 120 remaining) [2023-08-26 10:25:37,535 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err11ASSERT_VIOLATIONDATA_RACE (107 of 120 remaining) [2023-08-26 10:25:37,535 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err12ASSERT_VIOLATIONDATA_RACE (106 of 120 remaining) [2023-08-26 10:25:37,535 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err13ASSERT_VIOLATIONDATA_RACE (105 of 120 remaining) [2023-08-26 10:25:37,535 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err14ASSERT_VIOLATIONDATA_RACE (104 of 120 remaining) [2023-08-26 10:25:37,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err15ASSERT_VIOLATIONDATA_RACE (103 of 120 remaining) [2023-08-26 10:25:37,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err16ASSERT_VIOLATIONDATA_RACE (102 of 120 remaining) [2023-08-26 10:25:37,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err21ASSERT_VIOLATIONDATA_RACE (101 of 120 remaining) [2023-08-26 10:25:37,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err22ASSERT_VIOLATIONDATA_RACE (100 of 120 remaining) [2023-08-26 10:25:37,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err17ASSERT_VIOLATIONDATA_RACE (99 of 120 remaining) [2023-08-26 10:25:37,536 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err18ASSERT_VIOLATIONDATA_RACE (98 of 120 remaining) [2023-08-26 10:25:37,537 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err19ASSERT_VIOLATIONDATA_RACE (97 of 120 remaining) [2023-08-26 10:25:37,537 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err20ASSERT_VIOLATIONDATA_RACE (96 of 120 remaining) [2023-08-26 10:25:37,537 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (95 of 120 remaining) [2023-08-26 10:25:37,537 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (94 of 120 remaining) [2023-08-26 10:25:37,537 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (93 of 120 remaining) [2023-08-26 10:25:37,537 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (92 of 120 remaining) [2023-08-26 10:25:37,537 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (91 of 120 remaining) [2023-08-26 10:25:37,538 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (90 of 120 remaining) [2023-08-26 10:25:37,538 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (89 of 120 remaining) [2023-08-26 10:25:37,538 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (88 of 120 remaining) [2023-08-26 10:25:37,538 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONDATA_RACE (87 of 120 remaining) [2023-08-26 10:25:37,538 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONDATA_RACE (86 of 120 remaining) [2023-08-26 10:25:37,538 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONDATA_RACE (85 of 120 remaining) [2023-08-26 10:25:37,539 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONDATA_RACE (84 of 120 remaining) [2023-08-26 10:25:37,539 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONDATA_RACE (83 of 120 remaining) [2023-08-26 10:25:37,539 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONDATA_RACE (82 of 120 remaining) [2023-08-26 10:25:37,539 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14ASSERT_VIOLATIONDATA_RACE (81 of 120 remaining) [2023-08-26 10:25:37,539 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15ASSERT_VIOLATIONDATA_RACE (80 of 120 remaining) [2023-08-26 10:25:37,539 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err16ASSERT_VIOLATIONDATA_RACE (79 of 120 remaining) [2023-08-26 10:25:37,539 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err17ASSERT_VIOLATIONDATA_RACE (78 of 120 remaining) [2023-08-26 10:25:37,540 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err18ASSERT_VIOLATIONDATA_RACE (77 of 120 remaining) [2023-08-26 10:25:37,540 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err19ASSERT_VIOLATIONDATA_RACE (76 of 120 remaining) [2023-08-26 10:25:37,540 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err20ASSERT_VIOLATIONDATA_RACE (75 of 120 remaining) [2023-08-26 10:25:37,540 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err21ASSERT_VIOLATIONDATA_RACE (74 of 120 remaining) [2023-08-26 10:25:37,540 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err22ASSERT_VIOLATIONDATA_RACE (73 of 120 remaining) [2023-08-26 10:25:37,540 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err23ASSERT_VIOLATIONDATA_RACE (72 of 120 remaining) [2023-08-26 10:25:37,541 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err24ASSERT_VIOLATIONDATA_RACE (71 of 120 remaining) [2023-08-26 10:25:37,541 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (70 of 120 remaining) [2023-08-26 10:25:37,541 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (69 of 120 remaining) [2023-08-26 10:25:37,541 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (68 of 120 remaining) [2023-08-26 10:25:37,541 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (67 of 120 remaining) [2023-08-26 10:25:37,541 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (66 of 120 remaining) [2023-08-26 10:25:37,542 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (65 of 120 remaining) [2023-08-26 10:25:37,542 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (64 of 120 remaining) [2023-08-26 10:25:37,542 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (63 of 120 remaining) [2023-08-26 10:25:37,542 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (62 of 120 remaining) [2023-08-26 10:25:37,542 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (61 of 120 remaining) [2023-08-26 10:25:37,542 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (60 of 120 remaining) [2023-08-26 10:25:37,542 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (59 of 120 remaining) [2023-08-26 10:25:37,543 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (58 of 120 remaining) [2023-08-26 10:25:37,543 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (57 of 120 remaining) [2023-08-26 10:25:37,543 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (56 of 120 remaining) [2023-08-26 10:25:37,543 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (55 of 120 remaining) [2023-08-26 10:25:37,543 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (54 of 120 remaining) [2023-08-26 10:25:37,543 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (53 of 120 remaining) [2023-08-26 10:25:37,544 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (52 of 120 remaining) [2023-08-26 10:25:37,544 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (51 of 120 remaining) [2023-08-26 10:25:37,544 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (50 of 120 remaining) [2023-08-26 10:25:37,544 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 120 remaining) [2023-08-26 10:25:37,544 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 120 remaining) [2023-08-26 10:25:37,546 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (47 of 120 remaining) [2023-08-26 10:25:37,546 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (46 of 120 remaining) [2023-08-26 10:25:37,546 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (45 of 120 remaining) [2023-08-26 10:25:37,547 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (44 of 120 remaining) [2023-08-26 10:25:37,547 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (43 of 120 remaining) [2023-08-26 10:25:37,547 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (42 of 120 remaining) [2023-08-26 10:25:37,547 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (41 of 120 remaining) [2023-08-26 10:25:37,548 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (40 of 120 remaining) [2023-08-26 10:25:37,548 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONDATA_RACE (39 of 120 remaining) [2023-08-26 10:25:37,548 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONDATA_RACE (38 of 120 remaining) [2023-08-26 10:25:37,548 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err10ASSERT_VIOLATIONDATA_RACE (37 of 120 remaining) [2023-08-26 10:25:37,549 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err11ASSERT_VIOLATIONDATA_RACE (36 of 120 remaining) [2023-08-26 10:25:37,549 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err12ASSERT_VIOLATIONDATA_RACE (35 of 120 remaining) [2023-08-26 10:25:37,549 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err13ASSERT_VIOLATIONDATA_RACE (34 of 120 remaining) [2023-08-26 10:25:37,549 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err14ASSERT_VIOLATIONDATA_RACE (33 of 120 remaining) [2023-08-26 10:25:37,549 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err15ASSERT_VIOLATIONDATA_RACE (32 of 120 remaining) [2023-08-26 10:25:37,549 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err16ASSERT_VIOLATIONDATA_RACE (31 of 120 remaining) [2023-08-26 10:25:37,549 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err21ASSERT_VIOLATIONDATA_RACE (30 of 120 remaining) [2023-08-26 10:25:37,550 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err22ASSERT_VIOLATIONDATA_RACE (29 of 120 remaining) [2023-08-26 10:25:37,550 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err17ASSERT_VIOLATIONDATA_RACE (28 of 120 remaining) [2023-08-26 10:25:37,550 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err18ASSERT_VIOLATIONDATA_RACE (27 of 120 remaining) [2023-08-26 10:25:37,550 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err19ASSERT_VIOLATIONDATA_RACE (26 of 120 remaining) [2023-08-26 10:25:37,550 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err20ASSERT_VIOLATIONDATA_RACE (25 of 120 remaining) [2023-08-26 10:25:37,550 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 120 remaining) [2023-08-26 10:25:37,551 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 120 remaining) [2023-08-26 10:25:37,551 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 120 remaining) [2023-08-26 10:25:37,551 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 120 remaining) [2023-08-26 10:25:37,551 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 120 remaining) [2023-08-26 10:25:37,551 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (19 of 120 remaining) [2023-08-26 10:25:37,551 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 120 remaining) [2023-08-26 10:25:37,551 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (17 of 120 remaining) [2023-08-26 10:25:37,551 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONDATA_RACE (16 of 120 remaining) [2023-08-26 10:25:37,551 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONDATA_RACE (15 of 120 remaining) [2023-08-26 10:25:37,551 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONDATA_RACE (14 of 120 remaining) [2023-08-26 10:25:37,551 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONDATA_RACE (13 of 120 remaining) [2023-08-26 10:25:37,551 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 120 remaining) [2023-08-26 10:25:37,551 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONDATA_RACE (11 of 120 remaining) [2023-08-26 10:25:37,551 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14ASSERT_VIOLATIONDATA_RACE (10 of 120 remaining) [2023-08-26 10:25:37,551 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15ASSERT_VIOLATIONDATA_RACE (9 of 120 remaining) [2023-08-26 10:25:37,552 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err16ASSERT_VIOLATIONDATA_RACE (8 of 120 remaining) [2023-08-26 10:25:37,552 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err17ASSERT_VIOLATIONDATA_RACE (7 of 120 remaining) [2023-08-26 10:25:37,552 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err18ASSERT_VIOLATIONDATA_RACE (6 of 120 remaining) [2023-08-26 10:25:37,552 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err19ASSERT_VIOLATIONDATA_RACE (5 of 120 remaining) [2023-08-26 10:25:37,552 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err20ASSERT_VIOLATIONDATA_RACE (4 of 120 remaining) [2023-08-26 10:25:37,552 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err21ASSERT_VIOLATIONDATA_RACE (3 of 120 remaining) [2023-08-26 10:25:37,552 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err22ASSERT_VIOLATIONDATA_RACE (2 of 120 remaining) [2023-08-26 10:25:37,552 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err23ASSERT_VIOLATIONDATA_RACE (1 of 120 remaining) [2023-08-26 10:25:37,552 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err24ASSERT_VIOLATIONDATA_RACE (0 of 120 remaining) [2023-08-26 10:25:37,553 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:25:37,561 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 10:25:37,562 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 10:25:37,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 10:25:37 BasicIcfg [2023-08-26 10:25:37,565 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 10:25:37,568 INFO L158 Benchmark]: Toolchain (without parser) took 804123.72ms. Allocated memory was 358.6MB in the beginning and 14.8GB in the end (delta: 14.5GB). Free memory was 334.7MB in the beginning and 8.5GB in the end (delta: -8.1GB). Peak memory consumption was 13.4GB. Max. memory is 16.0GB. [2023-08-26 10:25:37,568 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 358.6MB. Free memory is still 336.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 10:25:37,569 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.41ms. Allocated memory is still 358.6MB. Free memory was 334.2MB in the beginning and 321.4MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-26 10:25:37,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.58ms. Allocated memory is still 358.6MB. Free memory was 321.4MB in the beginning and 318.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 10:25:37,569 INFO L158 Benchmark]: Boogie Preprocessor took 64.01ms. Allocated memory is still 358.6MB. Free memory was 318.2MB in the beginning and 315.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 10:25:37,570 INFO L158 Benchmark]: RCFGBuilder took 1156.17ms. Allocated memory is still 358.6MB. Free memory was 315.2MB in the beginning and 283.4MB in the end (delta: 31.7MB). Peak memory consumption was 49.4MB. Max. memory is 16.0GB. [2023-08-26 10:25:37,570 INFO L158 Benchmark]: TraceAbstraction took 802582.48ms. Allocated memory was 358.6MB in the beginning and 14.8GB in the end (delta: 14.5GB). Free memory was 282.4MB in the beginning and 8.5GB in the end (delta: -8.2GB). Peak memory consumption was 13.4GB. Max. memory is 16.0GB. [2023-08-26 10:25:37,571 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.14ms. Allocated memory is still 358.6MB. Free memory is still 336.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 239.41ms. Allocated memory is still 358.6MB. Free memory was 334.2MB in the beginning and 321.4MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 76.58ms. Allocated memory is still 358.6MB. Free memory was 321.4MB in the beginning and 318.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 64.01ms. Allocated memory is still 358.6MB. Free memory was 318.2MB in the beginning and 315.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1156.17ms. Allocated memory is still 358.6MB. Free memory was 315.2MB in the beginning and 283.4MB in the end (delta: 31.7MB). Peak memory consumption was 49.4MB. Max. memory is 16.0GB. * TraceAbstraction took 802582.48ms. Allocated memory was 358.6MB in the beginning and 14.8GB in the end (delta: 14.5GB). Free memory was 282.4MB in the beginning and 8.5GB in the end (delta: -8.2GB). Peak memory consumption was 13.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.6s, 357 PlacesBefore, 120 PlacesAfterwards, 366 TransitionsBefore, 119 TransitionsAfterwards, 11388 CoEnabledTransitionPairs, 9 FixpointIterations, 251 TrivialSequentialCompositions, 134 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 8 ConcurrentYvCompositions, 10 ChoiceCompositions, 429 TotalNumberOfCompositions, 60421 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19213, independent: 18167, independent conditional: 0, independent unconditional: 18167, dependent: 1046, dependent conditional: 0, dependent unconditional: 1046, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5528, independent: 5385, independent conditional: 0, independent unconditional: 5385, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 19213, independent: 12782, independent conditional: 0, independent unconditional: 12782, dependent: 903, dependent conditional: 0, dependent unconditional: 903, unknown: 5528, unknown conditional: 0, unknown unconditional: 5528] , Statistics on independence cache: Total cache size (in pairs): 701, Positive cache size: 618, Positive conditional cache size: 0, Positive unconditional cache size: 618, Negative cache size: 83, Negative conditional cache size: 0, Negative unconditional cache size: 83, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 53]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 53]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 118]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 118]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 55 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-14-6-12-6-9-5-11-4-10-4-9-4-8-4-6-4-5-4-6-2-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-298-22-6-17-6-16-6-15-6-3-5-3-7-12-4-12-4-11-4-8-4-9-4-8-4-7-4-8-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 482 locations, 120 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 802.4s, OverallIterations: 18, TraceHistogramMax: 4, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 186.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.8s, HoareTripleCheckerStatistics: 43 mSolverCounterUnknown, 5752 SdHoareTripleChecker+Valid, 20.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5752 mSDsluCounter, 935 SdHoareTripleChecker+Invalid, 18.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 260 IncrementalHoareTripleChecker+Unchecked, 838 mSDsCounter, 434 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10053 IncrementalHoareTripleChecker+Invalid, 10790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 434 mSolverCounterUnsat, 97 mSDtfsCounter, 10053 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 736 GetRequests, 379 SyntacticMatches, 3 SemanticMatches, 354 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 10314 ImplicationChecksByTransitivity, 44.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16297occurred in iteration=17, InterpolantAutomatonStates: 296, 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, 1.9s SatisfiabilityAnalysisTime, 31.8s InterpolantComputationTime, 770 NumberOfCodeBlocks, 770 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 970 ConstructedInterpolants, 82 QuantifiedInterpolants, 23086 SizeOfPredicates, 169 NumberOfNonLiveVariables, 2193 ConjunctsInSsa, 161 ConjunctsInUnsatCore, 27 InterpolantComputations, 13 PerfectInterpolantSequences, 54/131 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