/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 INSUFFICIENT_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-three-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 21:21:03,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 21:21:03,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-25 21:21:03,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 21:21:03,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 21:21:03,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 21:21:03,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 21:21:03,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 21:21:03,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 21:21:03,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 21:21:03,760 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 21:21:03,761 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 21:21:03,761 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 21:21:03,761 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 21:21:03,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 21:21:03,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 21:21:03,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 21:21:03,763 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 21:21:03,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 21:21:03,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 21:21:03,764 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 21:21:03,764 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 21:21:03,764 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 21:21:03,765 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 21:21:03,765 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 21:21:03,765 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 21:21:03,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 21:21:03,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 21:21:03,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 21:21:03,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 21:21:03,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 21:21:03,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 21:21:03,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 21:21:03,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 21:21:03,768 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 21:21:03,768 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 -> INSUFFICIENT_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-25 21:21:04,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 21:21:04,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 21:21:04,096 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 21:21:04,097 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 21:21:04,097 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 21:21:04,099 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2023-08-25 21:21:05,344 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 21:21:05,532 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 21:21:05,533 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2023-08-25 21:21:05,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8e771d13/36e0b9b9bf764c4a822267c43a8d0b84/FLAG0b982459b [2023-08-25 21:21:05,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8e771d13/36e0b9b9bf764c4a822267c43a8d0b84 [2023-08-25 21:21:05,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 21:21:05,554 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 21:21:05,555 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 21:21:05,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 21:21:05,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 21:21:05,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 09:21:05" (1/1) ... [2023-08-25 21:21:05,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@353dd3f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:21:05, skipping insertion in model container [2023-08-25 21:21:05,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 09:21:05" (1/1) ... [2023-08-25 21:21:05,577 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 21:21:05,761 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 21:21:05,774 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 21:21:05,840 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 21:21:05,847 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 21:21:05,847 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 21:21:05,855 INFO L206 MainTranslator]: Completed translation [2023-08-25 21:21:05,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:21:05 WrapperNode [2023-08-25 21:21:05,858 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 21:21:05,859 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 21:21:05,859 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 21:21:05,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 21:21:05,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:21:05" (1/1) ... [2023-08-25 21:21:05,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:21:05" (1/1) ... [2023-08-25 21:21:05,932 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 223 [2023-08-25 21:21:05,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 21:21:05,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 21:21:05,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 21:21:05,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 21:21:05,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:21:05" (1/1) ... [2023-08-25 21:21:05,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:21:05" (1/1) ... [2023-08-25 21:21:05,959 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:21:05" (1/1) ... [2023-08-25 21:21:05,959 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:21:05" (1/1) ... [2023-08-25 21:21:05,984 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:21:05" (1/1) ... [2023-08-25 21:21:05,988 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:21:05" (1/1) ... [2023-08-25 21:21:05,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:21:05" (1/1) ... [2023-08-25 21:21:05,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:21:05" (1/1) ... [2023-08-25 21:21:06,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 21:21:06,011 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 21:21:06,011 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 21:21:06,011 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 21:21:06,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:21:05" (1/1) ... [2023-08-25 21:21:06,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 21:21:06,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:21:06,042 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-25 21:21:06,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-25 21:21:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 21:21:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 21:21:06,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 21:21:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 21:21:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 21:21:06,087 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 21:21:06,087 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 21:21:06,087 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 21:21:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-25 21:21:06,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-25 21:21:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 21:21:06,088 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-25 21:21:06,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-25 21:21:06,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-25 21:21:06,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 21:21:06,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 21:21:06,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 21:21:06,091 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 21:21:06,222 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 21:21:06,223 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 21:21:06,726 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 21:21:06,816 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 21:21:06,816 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-25 21:21:06,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 09:21:06 BoogieIcfgContainer [2023-08-25 21:21:06,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 21:21:06,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 21:21:06,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 21:21:06,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 21:21:06,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 09:21:05" (1/3) ... [2023-08-25 21:21:06,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f98e261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 09:21:06, skipping insertion in model container [2023-08-25 21:21:06,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:21:05" (2/3) ... [2023-08-25 21:21:06,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f98e261 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 09:21:06, skipping insertion in model container [2023-08-25 21:21:06,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 09:21:06" (3/3) ... [2023-08-25 21:21:06,826 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2023-08-25 21:21:06,841 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 21:21:06,842 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 40 error locations. [2023-08-25 21:21:06,842 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 21:21:06,932 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-25 21:21:06,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 344 places, 354 transitions, 732 flow [2023-08-25 21:21:07,134 INFO L124 PetriNetUnfolderBase]: 20/351 cut-off events. [2023-08-25 21:21:07,134 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-25 21:21:07,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 351 events. 20/351 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 462 event pairs, 0 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 275. Up to 2 conditions per place. [2023-08-25 21:21:07,143 INFO L82 GeneralOperation]: Start removeDead. Operand has 344 places, 354 transitions, 732 flow [2023-08-25 21:21:07,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 330 places, 340 transitions, 698 flow [2023-08-25 21:21:07,159 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 21:21:07,168 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 330 places, 340 transitions, 698 flow [2023-08-25 21:21:07,170 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 330 places, 340 transitions, 698 flow [2023-08-25 21:21:07,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 330 places, 340 transitions, 698 flow [2023-08-25 21:21:07,234 INFO L124 PetriNetUnfolderBase]: 20/340 cut-off events. [2023-08-25 21:21:07,234 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-25 21:21:07,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 340 events. 20/340 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 463 event pairs, 0 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 275. Up to 2 conditions per place. [2023-08-25 21:21:07,245 INFO L119 LiptonReduction]: Number of co-enabled transitions 9904 [2023-08-25 21:21:21,114 INFO L134 LiptonReduction]: Checked pairs total: 61334 [2023-08-25 21:21:21,115 INFO L136 LiptonReduction]: Total number of compositions: 334 [2023-08-25 21:21:21,126 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 21:21:21,132 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;@1b277027, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 21:21:21,132 INFO L358 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2023-08-25 21:21:21,133 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 21:21:21,133 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 21:21:21,133 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 21:21:21,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:21:21,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 21:21:21,134 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 21:21:21,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:21:21,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1369, now seen corresponding path program 1 times [2023-08-25 21:21:21,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:21:21,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975591841] [2023-08-25 21:21:21,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:21:21,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:21:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:21:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:21:21,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:21:21,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975591841] [2023-08-25 21:21:21,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975591841] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:21:21,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:21:21,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 21:21:21,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846294595] [2023-08-25 21:21:21,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:21:21,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 21:21:21,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:21:21,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 21:21:21,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 21:21:21,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 688 [2023-08-25 21:21:21,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 232 flow. Second operand has 2 states, 2 states have (on average 319.5) internal successors, (639), 2 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:21,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:21:21,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 688 [2023-08-25 21:21:21,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:21:21,567 INFO L124 PetriNetUnfolderBase]: 779/1983 cut-off events. [2023-08-25 21:21:21,567 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2023-08-25 21:21:21,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3091 conditions, 1983 events. 779/1983 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 14593 event pairs, 384 based on Foata normal form. 338/1920 useless extension candidates. Maximal degree in co-relation 2706. Up to 1029 conditions per place. [2023-08-25 21:21:21,584 INFO L140 encePairwiseOnDemand]: 656/688 looper letters, 31 selfloop transitions, 0 changer transitions 0/75 dead transitions. [2023-08-25 21:21:21,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 75 transitions, 230 flow [2023-08-25 21:21:21,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 21:21:21,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 21:21:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 701 transitions. [2023-08-25 21:21:21,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5094476744186046 [2023-08-25 21:21:21,604 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 701 transitions. [2023-08-25 21:21:21,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 701 transitions. [2023-08-25 21:21:21,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:21:21,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 701 transitions. [2023-08-25 21:21:21,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 350.5) internal successors, (701), 2 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:21,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 688.0) internal successors, (2064), 3 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:21,622 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 688.0) internal successors, (2064), 3 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:21,623 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 232 flow. Second operand 2 states and 701 transitions. [2023-08-25 21:21:21,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 75 transitions, 230 flow [2023-08-25 21:21:21,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 75 transitions, 218 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-25 21:21:21,632 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 156 flow [2023-08-25 21:21:21,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=156, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2023-08-25 21:21:21,637 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -34 predicate places. [2023-08-25 21:21:21,637 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 156 flow [2023-08-25 21:21:21,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 319.5) internal successors, (639), 2 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:21,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:21:21,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:21:21,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 21:21:21,639 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 21:21:21,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:21:21,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1295070944, now seen corresponding path program 1 times [2023-08-25 21:21:21,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:21:21,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510143050] [2023-08-25 21:21:21,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:21:21,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:21:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:21:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:21:21,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:21:21,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510143050] [2023-08-25 21:21:21,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510143050] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:21:21,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:21:21,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:21:21,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487234161] [2023-08-25 21:21:21,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:21:21,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:21:21,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:21:21,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:21:21,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:21:21,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 688 [2023-08-25 21:21:21,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:21,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:21:21,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 688 [2023-08-25 21:21:21,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:21:22,193 INFO L124 PetriNetUnfolderBase]: 1570/3234 cut-off events. [2023-08-25 21:21:22,194 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-08-25 21:21:22,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5499 conditions, 3234 events. 1570/3234 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 21698 event pairs, 1187 based on Foata normal form. 0/2623 useless extension candidates. Maximal degree in co-relation 5496. Up to 2213 conditions per place. [2023-08-25 21:21:22,212 INFO L140 encePairwiseOnDemand]: 684/688 looper letters, 35 selfloop transitions, 1 changer transitions 0/72 dead transitions. [2023-08-25 21:21:22,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 72 transitions, 222 flow [2023-08-25 21:21:22,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:21:22,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:21:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 933 transitions. [2023-08-25 21:21:22,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45203488372093026 [2023-08-25 21:21:22,217 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 933 transitions. [2023-08-25 21:21:22,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 933 transitions. [2023-08-25 21:21:22,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:21:22,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 933 transitions. [2023-08-25 21:21:22,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 311.0) internal successors, (933), 3 states have internal predecessors, (933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:22,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 688.0) internal successors, (2752), 4 states have internal predecessors, (2752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:22,226 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 688.0) internal successors, (2752), 4 states have internal predecessors, (2752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:22,226 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 156 flow. Second operand 3 states and 933 transitions. [2023-08-25 21:21:22,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 72 transitions, 222 flow [2023-08-25 21:21:22,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 72 transitions, 222 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 21:21:22,229 INFO L231 Difference]: Finished difference. Result has 72 places, 72 transitions, 152 flow [2023-08-25 21:21:22,229 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=72, PETRI_TRANSITIONS=72} [2023-08-25 21:21:22,231 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -35 predicate places. [2023-08-25 21:21:22,231 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 72 transitions, 152 flow [2023-08-25 21:21:22,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:22,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:21:22,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:21:22,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 21:21:22,240 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 21:21:22,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:21:22,242 INFO L85 PathProgramCache]: Analyzing trace with hash -977065152, now seen corresponding path program 1 times [2023-08-25 21:21:22,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:21:22,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297459228] [2023-08-25 21:21:22,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:21:22,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:21:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:21:22,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:21:22,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:21:22,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297459228] [2023-08-25 21:21:22,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297459228] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:21:22,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:21:22,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:21:22,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161281581] [2023-08-25 21:21:22,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:21:22,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:21:22,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:21:22,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:21:22,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:21:22,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 688 [2023-08-25 21:21:22,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 72 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 315.6666666666667) internal successors, (947), 3 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:22,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:21:22,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 688 [2023-08-25 21:21:22,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:21:22,683 INFO L124 PetriNetUnfolderBase]: 1100/2303 cut-off events. [2023-08-25 21:21:22,683 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-25 21:21:22,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3816 conditions, 2303 events. 1100/2303 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 15144 event pairs, 158 based on Foata normal form. 0/1948 useless extension candidates. Maximal degree in co-relation 3812. Up to 1215 conditions per place. [2023-08-25 21:21:22,696 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 50 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2023-08-25 21:21:22,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 91 transitions, 299 flow [2023-08-25 21:21:22,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:21:22,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:21:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 992 transitions. [2023-08-25 21:21:22,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4806201550387597 [2023-08-25 21:21:22,700 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 992 transitions. [2023-08-25 21:21:22,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 992 transitions. [2023-08-25 21:21:22,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:21:22,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 992 transitions. [2023-08-25 21:21:22,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 330.6666666666667) internal successors, (992), 3 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:22,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 688.0) internal successors, (2752), 4 states have internal predecessors, (2752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:22,707 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 688.0) internal successors, (2752), 4 states have internal predecessors, (2752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:22,707 INFO L175 Difference]: Start difference. First operand has 72 places, 72 transitions, 152 flow. Second operand 3 states and 992 transitions. [2023-08-25 21:21:22,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 91 transitions, 299 flow [2023-08-25 21:21:22,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 91 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:21:22,710 INFO L231 Difference]: Finished difference. Result has 73 places, 73 transitions, 163 flow [2023-08-25 21:21:22,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=73, PETRI_TRANSITIONS=73} [2023-08-25 21:21:22,712 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -34 predicate places. [2023-08-25 21:21:22,712 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 73 transitions, 163 flow [2023-08-25 21:21:22,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.6666666666667) internal successors, (947), 3 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:22,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:21:22,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:21:22,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 21:21:22,716 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 21:21:22,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:21:22,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1619086085, now seen corresponding path program 1 times [2023-08-25 21:21:22,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:21:22,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52907837] [2023-08-25 21:21:22,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:21:22,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:21:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:21:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:21:23,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:21:23,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52907837] [2023-08-25 21:21:23,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52907837] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:21:23,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:21:23,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:21:23,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415789530] [2023-08-25 21:21:23,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:21:23,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:21:23,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:21:23,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:21:23,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:21:23,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 688 [2023-08-25 21:21:23,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 73 transitions, 163 flow. Second operand has 6 states, 6 states have (on average 267.5) internal successors, (1605), 6 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:23,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:21:23,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 688 [2023-08-25 21:21:23,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:21:25,053 INFO L124 PetriNetUnfolderBase]: 10169/13782 cut-off events. [2023-08-25 21:21:25,053 INFO L125 PetriNetUnfolderBase]: For 1792/1813 co-relation queries the response was YES. [2023-08-25 21:21:25,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28859 conditions, 13782 events. 10169/13782 cut-off events. For 1792/1813 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 78424 event pairs, 2049 based on Foata normal form. 0/11475 useless extension candidates. Maximal degree in co-relation 28855. Up to 7220 conditions per place. [2023-08-25 21:21:25,144 INFO L140 encePairwiseOnDemand]: 681/688 looper letters, 164 selfloop transitions, 13 changer transitions 0/190 dead transitions. [2023-08-25 21:21:25,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 190 transitions, 794 flow [2023-08-25 21:21:25,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:21:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:21:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1758 transitions. [2023-08-25 21:21:25,149 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4258720930232558 [2023-08-25 21:21:25,149 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1758 transitions. [2023-08-25 21:21:25,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1758 transitions. [2023-08-25 21:21:25,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:21:25,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1758 transitions. [2023-08-25 21:21:25,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:25,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:25,161 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:25,161 INFO L175 Difference]: Start difference. First operand has 73 places, 73 transitions, 163 flow. Second operand 6 states and 1758 transitions. [2023-08-25 21:21:25,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 190 transitions, 794 flow [2023-08-25 21:21:25,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 190 transitions, 794 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 21:21:25,167 INFO L231 Difference]: Finished difference. Result has 83 places, 85 transitions, 273 flow [2023-08-25 21:21:25,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=273, PETRI_PLACES=83, PETRI_TRANSITIONS=85} [2023-08-25 21:21:25,168 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -24 predicate places. [2023-08-25 21:21:25,168 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 85 transitions, 273 flow [2023-08-25 21:21:25,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 267.5) internal successors, (1605), 6 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:25,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:21:25,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:21:25,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 21:21:25,169 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 21:21:25,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:21:25,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1652271964, now seen corresponding path program 1 times [2023-08-25 21:21:25,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:21:25,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087039851] [2023-08-25 21:21:25,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:21:25,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:21:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:21:25,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:21:25,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:21:25,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087039851] [2023-08-25 21:21:25,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087039851] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:21:25,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:21:25,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 21:21:25,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169415352] [2023-08-25 21:21:25,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:21:25,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 21:21:25,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:21:25,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 21:21:25,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 21:21:25,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 688 [2023-08-25 21:21:25,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 85 transitions, 273 flow. Second operand has 5 states, 5 states have (on average 238.8) internal successors, (1194), 5 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:25,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:21:25,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 688 [2023-08-25 21:21:25,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:21:26,758 INFO L124 PetriNetUnfolderBase]: 5999/9614 cut-off events. [2023-08-25 21:21:26,759 INFO L125 PetriNetUnfolderBase]: For 9009/9251 co-relation queries the response was YES. [2023-08-25 21:21:26,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23541 conditions, 9614 events. 5999/9614 cut-off events. For 9009/9251 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 66269 event pairs, 2697 based on Foata normal form. 0/8092 useless extension candidates. Maximal degree in co-relation 23532. Up to 6670 conditions per place. [2023-08-25 21:21:26,818 INFO L140 encePairwiseOnDemand]: 678/688 looper letters, 102 selfloop transitions, 15 changer transitions 0/148 dead transitions. [2023-08-25 21:21:26,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 148 transitions, 763 flow [2023-08-25 21:21:26,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:21:26,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:21:26,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1506 transitions. [2023-08-25 21:21:26,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3648255813953488 [2023-08-25 21:21:26,823 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1506 transitions. [2023-08-25 21:21:26,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1506 transitions. [2023-08-25 21:21:26,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:21:26,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1506 transitions. [2023-08-25 21:21:26,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:26,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:26,843 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:26,843 INFO L175 Difference]: Start difference. First operand has 83 places, 85 transitions, 273 flow. Second operand 6 states and 1506 transitions. [2023-08-25 21:21:26,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 148 transitions, 763 flow [2023-08-25 21:21:26,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 148 transitions, 763 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 21:21:26,869 INFO L231 Difference]: Finished difference. Result has 92 places, 98 transitions, 375 flow [2023-08-25 21:21:26,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=375, PETRI_PLACES=92, PETRI_TRANSITIONS=98} [2023-08-25 21:21:26,871 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -15 predicate places. [2023-08-25 21:21:26,871 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 98 transitions, 375 flow [2023-08-25 21:21:26,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 238.8) internal successors, (1194), 5 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:26,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:21:26,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:21:26,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 21:21:26,872 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 21:21:26,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:21:26,873 INFO L85 PathProgramCache]: Analyzing trace with hash 476262221, now seen corresponding path program 1 times [2023-08-25 21:21:26,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:21:26,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304528499] [2023-08-25 21:21:26,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:21:26,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:21:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:21:27,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 21:21:27,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:21:27,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304528499] [2023-08-25 21:21:27,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304528499] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:21:27,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:21:27,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:21:27,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116307826] [2023-08-25 21:21:27,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:21:27,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:21:27,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:21:27,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:21:27,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:21:27,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 688 [2023-08-25 21:21:27,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 98 transitions, 375 flow. Second operand has 6 states, 6 states have (on average 263.8333333333333) internal successors, (1583), 6 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:27,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:21:27,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 688 [2023-08-25 21:21:27,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:21:29,710 INFO L124 PetriNetUnfolderBase]: 17976/24661 cut-off events. [2023-08-25 21:21:29,711 INFO L125 PetriNetUnfolderBase]: For 15959/16059 co-relation queries the response was YES. [2023-08-25 21:21:29,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61843 conditions, 24661 events. 17976/24661 cut-off events. For 15959/16059 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 150627 event pairs, 4985 based on Foata normal form. 0/21125 useless extension candidates. Maximal degree in co-relation 61829. Up to 16199 conditions per place. [2023-08-25 21:21:29,984 INFO L140 encePairwiseOnDemand]: 680/688 looper letters, 174 selfloop transitions, 26 changer transitions 0/210 dead transitions. [2023-08-25 21:21:29,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 210 transitions, 1239 flow [2023-08-25 21:21:29,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:21:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:21:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1708 transitions. [2023-08-25 21:21:29,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41375968992248063 [2023-08-25 21:21:29,989 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1708 transitions. [2023-08-25 21:21:29,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1708 transitions. [2023-08-25 21:21:29,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:21:29,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1708 transitions. [2023-08-25 21:21:29,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 284.6666666666667) internal successors, (1708), 6 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:29,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:29,999 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:29,999 INFO L175 Difference]: Start difference. First operand has 92 places, 98 transitions, 375 flow. Second operand 6 states and 1708 transitions. [2023-08-25 21:21:29,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 210 transitions, 1239 flow [2023-08-25 21:21:30,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 210 transitions, 1239 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 21:21:30,100 INFO L231 Difference]: Finished difference. Result has 102 places, 123 transitions, 663 flow [2023-08-25 21:21:30,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=663, PETRI_PLACES=102, PETRI_TRANSITIONS=123} [2023-08-25 21:21:30,103 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, -5 predicate places. [2023-08-25 21:21:30,103 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 123 transitions, 663 flow [2023-08-25 21:21:30,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 263.8333333333333) internal successors, (1583), 6 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:30,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:21:30,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:21:30,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 21:21:30,104 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 21:21:30,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:21:30,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1696449613, now seen corresponding path program 1 times [2023-08-25 21:21:30,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:21:30,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635110979] [2023-08-25 21:21:30,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:21:30,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:21:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:21:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:21:30,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:21:30,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635110979] [2023-08-25 21:21:30,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635110979] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:21:30,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:21:30,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 21:21:30,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717895471] [2023-08-25 21:21:30,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:21:30,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 21:21:30,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:21:30,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 21:21:30,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 21:21:30,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 688 [2023-08-25 21:21:30,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 123 transitions, 663 flow. Second operand has 5 states, 5 states have (on average 252.4) internal successors, (1262), 5 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:30,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:21:30,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 688 [2023-08-25 21:21:30,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:21:31,259 INFO L124 PetriNetUnfolderBase]: 3543/7365 cut-off events. [2023-08-25 21:21:31,259 INFO L125 PetriNetUnfolderBase]: For 9328/9669 co-relation queries the response was YES. [2023-08-25 21:21:31,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17845 conditions, 7365 events. 3543/7365 cut-off events. For 9328/9669 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 60702 event pairs, 1371 based on Foata normal form. 112/6398 useless extension candidates. Maximal degree in co-relation 17826. Up to 4179 conditions per place. [2023-08-25 21:21:31,310 INFO L140 encePairwiseOnDemand]: 678/688 looper letters, 89 selfloop transitions, 12 changer transitions 0/148 dead transitions. [2023-08-25 21:21:31,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 148 transitions, 915 flow [2023-08-25 21:21:31,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:21:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:21:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1572 transitions. [2023-08-25 21:21:31,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3808139534883721 [2023-08-25 21:21:31,315 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1572 transitions. [2023-08-25 21:21:31,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1572 transitions. [2023-08-25 21:21:31,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:21:31,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1572 transitions. [2023-08-25 21:21:31,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 262.0) internal successors, (1572), 6 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:31,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:31,324 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:31,325 INFO L175 Difference]: Start difference. First operand has 102 places, 123 transitions, 663 flow. Second operand 6 states and 1572 transitions. [2023-08-25 21:21:31,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 148 transitions, 915 flow [2023-08-25 21:21:31,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 148 transitions, 875 flow, removed 20 selfloop flow, removed 0 redundant places. [2023-08-25 21:21:31,346 INFO L231 Difference]: Finished difference. Result has 109 places, 122 transitions, 653 flow [2023-08-25 21:21:31,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=653, PETRI_PLACES=109, PETRI_TRANSITIONS=122} [2023-08-25 21:21:31,347 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 2 predicate places. [2023-08-25 21:21:31,347 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 122 transitions, 653 flow [2023-08-25 21:21:31,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 252.4) internal successors, (1262), 5 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:31,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:21:31,348 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] [2023-08-25 21:21:31,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 21:21:31,348 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 21:21:31,348 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:21:31,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1873163792, now seen corresponding path program 1 times [2023-08-25 21:21:31,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:21:31,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851197015] [2023-08-25 21:21:31,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:21:31,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:21:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:21:31,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 21:21:31,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:21:31,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851197015] [2023-08-25 21:21:31,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851197015] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:21:31,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:21:31,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:21:31,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559508396] [2023-08-25 21:21:31,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:21:31,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:21:31,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:21:31,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:21:31,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:21:31,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 688 [2023-08-25 21:21:31,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 122 transitions, 653 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:31,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:21:31,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 688 [2023-08-25 21:21:31,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:21:32,422 INFO L124 PetriNetUnfolderBase]: 4585/8118 cut-off events. [2023-08-25 21:21:32,422 INFO L125 PetriNetUnfolderBase]: For 15110/15983 co-relation queries the response was YES. [2023-08-25 21:21:32,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22557 conditions, 8118 events. 4585/8118 cut-off events. For 15110/15983 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 58783 event pairs, 388 based on Foata normal form. 91/7268 useless extension candidates. Maximal degree in co-relation 22535. Up to 4975 conditions per place. [2023-08-25 21:21:32,493 INFO L140 encePairwiseOnDemand]: 685/688 looper letters, 88 selfloop transitions, 31 changer transitions 0/166 dead transitions. [2023-08-25 21:21:32,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 166 transitions, 1182 flow [2023-08-25 21:21:32,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:21:32,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:21:32,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 994 transitions. [2023-08-25 21:21:32,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48158914728682173 [2023-08-25 21:21:32,497 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 994 transitions. [2023-08-25 21:21:32,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 994 transitions. [2023-08-25 21:21:32,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:21:32,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 994 transitions. [2023-08-25 21:21:32,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:32,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 688.0) internal successors, (2752), 4 states have internal predecessors, (2752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:32,504 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 688.0) internal successors, (2752), 4 states have internal predecessors, (2752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:32,504 INFO L175 Difference]: Start difference. First operand has 109 places, 122 transitions, 653 flow. Second operand 3 states and 994 transitions. [2023-08-25 21:21:32,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 166 transitions, 1182 flow [2023-08-25 21:21:32,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 166 transitions, 1164 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-25 21:21:32,550 INFO L231 Difference]: Finished difference. Result has 108 places, 147 transitions, 1020 flow [2023-08-25 21:21:32,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1020, PETRI_PLACES=108, PETRI_TRANSITIONS=147} [2023-08-25 21:21:32,551 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 1 predicate places. [2023-08-25 21:21:32,551 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 147 transitions, 1020 flow [2023-08-25 21:21:32,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:32,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:21:32,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:21:32,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 21:21:32,553 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 21:21:32,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:21:32,553 INFO L85 PathProgramCache]: Analyzing trace with hash -862635616, now seen corresponding path program 1 times [2023-08-25 21:21:32,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:21:32,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974745425] [2023-08-25 21:21:32,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:21:32,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:21:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:21:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 21:21:33,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:21:33,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974745425] [2023-08-25 21:21:33,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974745425] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:21:33,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:21:33,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 21:21:33,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706830396] [2023-08-25 21:21:33,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:21:33,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 21:21:33,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:21:33,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 21:21:33,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-25 21:21:33,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 688 [2023-08-25 21:21:33,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 147 transitions, 1020 flow. Second operand has 11 states, 11 states have (on average 240.72727272727272) internal successors, (2648), 11 states have internal predecessors, (2648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:33,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:21:33,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 688 [2023-08-25 21:21:33,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:21:36,045 INFO L124 PetriNetUnfolderBase]: 16682/22821 cut-off events. [2023-08-25 21:21:36,045 INFO L125 PetriNetUnfolderBase]: For 34005/34417 co-relation queries the response was YES. [2023-08-25 21:21:36,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67745 conditions, 22821 events. 16682/22821 cut-off events. For 34005/34417 co-relation queries the response was YES. Maximal size of possible extension queue 915. Compared 140675 event pairs, 2101 based on Foata normal form. 513/20625 useless extension candidates. Maximal degree in co-relation 67723. Up to 7802 conditions per place. [2023-08-25 21:21:36,213 INFO L140 encePairwiseOnDemand]: 682/688 looper letters, 274 selfloop transitions, 8 changer transitions 0/294 dead transitions. [2023-08-25 21:21:36,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 294 transitions, 2276 flow [2023-08-25 21:21:36,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-25 21:21:36,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-25 21:21:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1829 transitions. [2023-08-25 21:21:36,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37977574750830567 [2023-08-25 21:21:36,219 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1829 transitions. [2023-08-25 21:21:36,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1829 transitions. [2023-08-25 21:21:36,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:21:36,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1829 transitions. [2023-08-25 21:21:36,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 261.2857142857143) internal successors, (1829), 7 states have internal predecessors, (1829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:36,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 688.0) internal successors, (5504), 8 states have internal predecessors, (5504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:36,230 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 688.0) internal successors, (5504), 8 states have internal predecessors, (5504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:36,230 INFO L175 Difference]: Start difference. First operand has 108 places, 147 transitions, 1020 flow. Second operand 7 states and 1829 transitions. [2023-08-25 21:21:36,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 294 transitions, 2276 flow [2023-08-25 21:21:36,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 294 transitions, 2263 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:21:36,443 INFO L231 Difference]: Finished difference. Result has 112 places, 146 transitions, 1019 flow [2023-08-25 21:21:36,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1003, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1019, PETRI_PLACES=112, PETRI_TRANSITIONS=146} [2023-08-25 21:21:36,444 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 5 predicate places. [2023-08-25 21:21:36,444 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 146 transitions, 1019 flow [2023-08-25 21:21:36,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 240.72727272727272) internal successors, (2648), 11 states have internal predecessors, (2648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:36,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:21:36,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:21:36,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 21:21:36,445 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 21:21:36,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:21:36,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1086127665, now seen corresponding path program 1 times [2023-08-25 21:21:36,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:21:36,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120589850] [2023-08-25 21:21:36,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:21:36,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:21:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:21:37,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 21:21:37,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:21:37,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120589850] [2023-08-25 21:21:37,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120589850] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:21:37,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:21:37,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-25 21:21:37,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680305132] [2023-08-25 21:21:37,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:21:37,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 21:21:37,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:21:37,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 21:21:37,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-25 21:21:37,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 688 [2023-08-25 21:21:37,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 146 transitions, 1019 flow. Second operand has 9 states, 9 states have (on average 229.33333333333334) internal successors, (2064), 9 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:37,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:21:37,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 688 [2023-08-25 21:21:37,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:21:43,024 INFO L124 PetriNetUnfolderBase]: 35753/49303 cut-off events. [2023-08-25 21:21:43,024 INFO L125 PetriNetUnfolderBase]: For 80353/81100 co-relation queries the response was YES. [2023-08-25 21:21:43,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147578 conditions, 49303 events. 35753/49303 cut-off events. For 80353/81100 co-relation queries the response was YES. Maximal size of possible extension queue 1452. Compared 313272 event pairs, 6149 based on Foata normal form. 113/43842 useless extension candidates. Maximal degree in co-relation 147556. Up to 14578 conditions per place. [2023-08-25 21:21:43,443 INFO L140 encePairwiseOnDemand]: 676/688 looper letters, 319 selfloop transitions, 72 changer transitions 0/399 dead transitions. [2023-08-25 21:21:43,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 399 transitions, 3716 flow [2023-08-25 21:21:43,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-25 21:21:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-25 21:21:43,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2682 transitions. [2023-08-25 21:21:43,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35438689217758984 [2023-08-25 21:21:43,451 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2682 transitions. [2023-08-25 21:21:43,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2682 transitions. [2023-08-25 21:21:43,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:21:43,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2682 transitions. [2023-08-25 21:21:43,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 243.8181818181818) internal successors, (2682), 11 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:43,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 688.0) internal successors, (8256), 12 states have internal predecessors, (8256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:43,467 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 688.0) internal successors, (8256), 12 states have internal predecessors, (8256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:43,467 INFO L175 Difference]: Start difference. First operand has 112 places, 146 transitions, 1019 flow. Second operand 11 states and 2682 transitions. [2023-08-25 21:21:43,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 399 transitions, 3716 flow [2023-08-25 21:21:43,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 399 transitions, 3652 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-25 21:21:43,803 INFO L231 Difference]: Finished difference. Result has 121 places, 204 transitions, 1939 flow [2023-08-25 21:21:43,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1005, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1939, PETRI_PLACES=121, PETRI_TRANSITIONS=204} [2023-08-25 21:21:43,804 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 14 predicate places. [2023-08-25 21:21:43,804 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 204 transitions, 1939 flow [2023-08-25 21:21:43,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 229.33333333333334) internal successors, (2064), 9 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:43,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:21:43,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:21:43,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 21:21:43,805 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 21:21:43,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:21:43,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1448235429, now seen corresponding path program 2 times [2023-08-25 21:21:43,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:21:43,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477510754] [2023-08-25 21:21:43,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:21:43,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:21:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:21:44,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 21:21:44,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:21:44,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477510754] [2023-08-25 21:21:44,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477510754] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:21:44,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:21:44,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-25 21:21:44,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319363520] [2023-08-25 21:21:44,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:21:44,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 21:21:44,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:21:44,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 21:21:44,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-25 21:21:44,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 688 [2023-08-25 21:21:44,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 204 transitions, 1939 flow. Second operand has 9 states, 9 states have (on average 229.33333333333334) internal successors, (2064), 9 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:44,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:21:44,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 688 [2023-08-25 21:21:44,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:21:52,362 INFO L124 PetriNetUnfolderBase]: 49148/67287 cut-off events. [2023-08-25 21:21:52,362 INFO L125 PetriNetUnfolderBase]: For 167092/167975 co-relation queries the response was YES. [2023-08-25 21:21:52,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221100 conditions, 67287 events. 49148/67287 cut-off events. For 167092/167975 co-relation queries the response was YES. Maximal size of possible extension queue 2016. Compared 443363 event pairs, 10091 based on Foata normal form. 121/60512 useless extension candidates. Maximal degree in co-relation 221074. Up to 42407 conditions per place. [2023-08-25 21:21:53,144 INFO L140 encePairwiseOnDemand]: 676/688 looper letters, 247 selfloop transitions, 141 changer transitions 0/396 dead transitions. [2023-08-25 21:21:53,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 396 transitions, 4067 flow [2023-08-25 21:21:53,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-25 21:21:53,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-25 21:21:53,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2448 transitions. [2023-08-25 21:21:53,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3558139534883721 [2023-08-25 21:21:53,150 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2448 transitions. [2023-08-25 21:21:53,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2448 transitions. [2023-08-25 21:21:53,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:21:53,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2448 transitions. [2023-08-25 21:21:53,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 244.8) internal successors, (2448), 10 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:53,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 688.0) internal successors, (7568), 11 states have internal predecessors, (7568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:53,164 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 688.0) internal successors, (7568), 11 states have internal predecessors, (7568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:53,164 INFO L175 Difference]: Start difference. First operand has 121 places, 204 transitions, 1939 flow. Second operand 10 states and 2448 transitions. [2023-08-25 21:21:53,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 396 transitions, 4067 flow [2023-08-25 21:21:53,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 396 transitions, 4048 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-25 21:21:53,835 INFO L231 Difference]: Finished difference. Result has 130 places, 258 transitions, 3094 flow [2023-08-25 21:21:53,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=1920, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3094, PETRI_PLACES=130, PETRI_TRANSITIONS=258} [2023-08-25 21:21:53,836 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 23 predicate places. [2023-08-25 21:21:53,836 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 258 transitions, 3094 flow [2023-08-25 21:21:53,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 229.33333333333334) internal successors, (2064), 9 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:53,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:21:53,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:21:53,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-25 21:21:53,837 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 21:21:53,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:21:53,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1391483523, now seen corresponding path program 1 times [2023-08-25 21:21:53,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:21:53,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693685186] [2023-08-25 21:21:53,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:21:53,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:21:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:21:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:21:54,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:21:54,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693685186] [2023-08-25 21:21:54,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693685186] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:21:54,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:21:54,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:21:54,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901923394] [2023-08-25 21:21:54,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:21:54,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:21:54,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:21:54,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:21:54,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:21:54,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 688 [2023-08-25 21:21:54,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 258 transitions, 3094 flow. Second operand has 6 states, 6 states have (on average 268.8333333333333) internal successors, (1613), 6 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:54,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:21:54,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 688 [2023-08-25 21:21:54,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:22:01,497 INFO L124 PetriNetUnfolderBase]: 42184/58501 cut-off events. [2023-08-25 21:22:01,497 INFO L125 PetriNetUnfolderBase]: For 214562/217908 co-relation queries the response was YES. [2023-08-25 21:22:01,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209402 conditions, 58501 events. 42184/58501 cut-off events. For 214562/217908 co-relation queries the response was YES. Maximal size of possible extension queue 1885. Compared 389361 event pairs, 18181 based on Foata normal form. 822/53175 useless extension candidates. Maximal degree in co-relation 209372. Up to 53066 conditions per place. [2023-08-25 21:22:02,246 INFO L140 encePairwiseOnDemand]: 681/688 looper letters, 275 selfloop transitions, 21 changer transitions 0/315 dead transitions. [2023-08-25 21:22:02,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 315 transitions, 4102 flow [2023-08-25 21:22:02,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:22:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:22:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1685 transitions. [2023-08-25 21:22:02,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40818798449612403 [2023-08-25 21:22:02,252 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1685 transitions. [2023-08-25 21:22:02,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1685 transitions. [2023-08-25 21:22:02,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:22:02,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1685 transitions. [2023-08-25 21:22:02,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 280.8333333333333) internal successors, (1685), 6 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:02,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:02,261 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:02,261 INFO L175 Difference]: Start difference. First operand has 130 places, 258 transitions, 3094 flow. Second operand 6 states and 1685 transitions. [2023-08-25 21:22:02,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 315 transitions, 4102 flow [2023-08-25 21:22:04,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 315 transitions, 3951 flow, removed 68 selfloop flow, removed 4 redundant places. [2023-08-25 21:22:04,711 INFO L231 Difference]: Finished difference. Result has 136 places, 278 transitions, 3297 flow [2023-08-25 21:22:04,712 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=2959, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3297, PETRI_PLACES=136, PETRI_TRANSITIONS=278} [2023-08-25 21:22:04,712 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 29 predicate places. [2023-08-25 21:22:04,712 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 278 transitions, 3297 flow [2023-08-25 21:22:04,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 268.8333333333333) internal successors, (1613), 6 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:04,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:22:04,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:22:04,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-25 21:22:04,713 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 21:22:04,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:22:04,713 INFO L85 PathProgramCache]: Analyzing trace with hash 968447700, now seen corresponding path program 1 times [2023-08-25 21:22:04,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:22:04,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121768584] [2023-08-25 21:22:04,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:22:04,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:22:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:22:05,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 21:22:05,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:22:05,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121768584] [2023-08-25 21:22:05,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121768584] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:22:05,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:22:05,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:22:05,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650741724] [2023-08-25 21:22:05,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:22:05,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:22:05,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:22:05,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:22:05,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:22:05,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 688 [2023-08-25 21:22:05,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 278 transitions, 3297 flow. Second operand has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:05,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:22:05,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 688 [2023-08-25 21:22:05,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:22:13,467 INFO L124 PetriNetUnfolderBase]: 48713/66310 cut-off events. [2023-08-25 21:22:13,467 INFO L125 PetriNetUnfolderBase]: For 229392/232039 co-relation queries the response was YES. [2023-08-25 21:22:13,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230674 conditions, 66310 events. 48713/66310 cut-off events. For 229392/232039 co-relation queries the response was YES. Maximal size of possible extension queue 2041. Compared 433919 event pairs, 15682 based on Foata normal form. 2532/61714 useless extension candidates. Maximal degree in co-relation 230640. Up to 50700 conditions per place. [2023-08-25 21:22:14,185 INFO L140 encePairwiseOnDemand]: 681/688 looper letters, 351 selfloop transitions, 112 changer transitions 0/476 dead transitions. [2023-08-25 21:22:14,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 476 transitions, 6306 flow [2023-08-25 21:22:14,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:22:14,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:22:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1695 transitions. [2023-08-25 21:22:14,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4106104651162791 [2023-08-25 21:22:14,190 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1695 transitions. [2023-08-25 21:22:14,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1695 transitions. [2023-08-25 21:22:14,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:22:14,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1695 transitions. [2023-08-25 21:22:14,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 282.5) internal successors, (1695), 6 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:14,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:14,198 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:14,198 INFO L175 Difference]: Start difference. First operand has 136 places, 278 transitions, 3297 flow. Second operand 6 states and 1695 transitions. [2023-08-25 21:22:14,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 476 transitions, 6306 flow [2023-08-25 21:22:16,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 476 transitions, 6282 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-25 21:22:16,510 INFO L231 Difference]: Finished difference. Result has 145 places, 384 transitions, 5343 flow [2023-08-25 21:22:16,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=3273, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5343, PETRI_PLACES=145, PETRI_TRANSITIONS=384} [2023-08-25 21:22:16,511 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 38 predicate places. [2023-08-25 21:22:16,511 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 384 transitions, 5343 flow [2023-08-25 21:22:16,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:16,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:22:16,512 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] [2023-08-25 21:22:16,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-25 21:22:16,512 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 21:22:16,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:22:16,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2874919, now seen corresponding path program 3 times [2023-08-25 21:22:16,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:22:16,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646202988] [2023-08-25 21:22:16,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:22:16,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:22:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:22:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 21:22:16,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:22:16,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646202988] [2023-08-25 21:22:16,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646202988] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:22:16,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751188980] [2023-08-25 21:22:16,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 21:22:16,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:22:16,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:22:16,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:22:16,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-25 21:22:16,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-25 21:22:16,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 21:22:16,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 67 conjunts are in the unsatisfiable core [2023-08-25 21:22:16,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:22:17,046 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-25 21:22:17,047 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 15 treesize of output 42 [2023-08-25 21:22:17,095 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-25 21:22:17,095 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-25 21:22:17,140 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-25 21:22:17,141 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-25 21:22:17,331 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 21:22:17,371 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-25 21:22:17,414 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-25 21:22:17,465 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-08-25 21:22:17,583 INFO L322 Elim1Store]: treesize reduction 64, result has 31.2 percent of original size [2023-08-25 21:22:17,583 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 92 [2023-08-25 21:22:17,596 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 70 [2023-08-25 21:22:17,713 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-25 21:22:17,714 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 21:22:17,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751188980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:22:17,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 21:22:17,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 16 [2023-08-25 21:22:17,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232457225] [2023-08-25 21:22:17,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:22:17,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-25 21:22:17,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:22:17,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-25 21:22:17,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-08-25 21:22:17,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 688 [2023-08-25 21:22:17,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 384 transitions, 5343 flow. Second operand has 12 states, 12 states have (on average 234.75) internal successors, (2817), 12 states have internal predecessors, (2817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:17,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:22:17,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 688 [2023-08-25 21:22:17,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:22:27,232 INFO L124 PetriNetUnfolderBase]: 50593/69007 cut-off events. [2023-08-25 21:22:27,232 INFO L125 PetriNetUnfolderBase]: For 286088/289237 co-relation queries the response was YES. [2023-08-25 21:22:27,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257505 conditions, 69007 events. 50593/69007 cut-off events. For 286088/289237 co-relation queries the response was YES. Maximal size of possible extension queue 2018. Compared 452246 event pairs, 10195 based on Foata normal form. 1979/63855 useless extension candidates. Maximal degree in co-relation 257466. Up to 24530 conditions per place. [2023-08-25 21:22:28,034 INFO L140 encePairwiseOnDemand]: 676/688 looper letters, 547 selfloop transitions, 36 changer transitions 0/596 dead transitions. [2023-08-25 21:22:28,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 596 transitions, 8511 flow [2023-08-25 21:22:28,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-25 21:22:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-25 21:22:28,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2721 transitions. [2023-08-25 21:22:28,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35954016913319237 [2023-08-25 21:22:28,039 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2721 transitions. [2023-08-25 21:22:28,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2721 transitions. [2023-08-25 21:22:28,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:22:28,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2721 transitions. [2023-08-25 21:22:28,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 247.36363636363637) internal successors, (2721), 11 states have internal predecessors, (2721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:28,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 688.0) internal successors, (8256), 12 states have internal predecessors, (8256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:28,050 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 688.0) internal successors, (8256), 12 states have internal predecessors, (8256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:28,051 INFO L175 Difference]: Start difference. First operand has 145 places, 384 transitions, 5343 flow. Second operand 11 states and 2721 transitions. [2023-08-25 21:22:28,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 596 transitions, 8511 flow [2023-08-25 21:22:31,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 596 transitions, 8119 flow, removed 196 selfloop flow, removed 0 redundant places. [2023-08-25 21:22:31,440 INFO L231 Difference]: Finished difference. Result has 160 places, 391 transitions, 5245 flow [2023-08-25 21:22:31,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=5087, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5245, PETRI_PLACES=160, PETRI_TRANSITIONS=391} [2023-08-25 21:22:31,441 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 53 predicate places. [2023-08-25 21:22:31,441 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 391 transitions, 5245 flow [2023-08-25 21:22:31,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 234.75) internal successors, (2817), 12 states have internal predecessors, (2817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:31,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:22:31,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:22:31,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-25 21:22:31,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-25 21:22:31,648 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 21:22:31,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:22:31,648 INFO L85 PathProgramCache]: Analyzing trace with hash 859619338, now seen corresponding path program 1 times [2023-08-25 21:22:31,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:22:31,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246402400] [2023-08-25 21:22:31,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:22:31,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:22:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:22:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 21:22:31,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:22:31,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246402400] [2023-08-25 21:22:31,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246402400] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:22:31,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439136851] [2023-08-25 21:22:31,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:22:31,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:22:31,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:22:31,777 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:22:31,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-25 21:22:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:22:31,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-25 21:22:31,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:22:31,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 21:22:31,991 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:22:32,027 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 21:22:32,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439136851] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-25 21:22:32,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-25 21:22:32,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-08-25 21:22:32,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607166713] [2023-08-25 21:22:32,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:22:32,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 21:22:32,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:22:32,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 21:22:32,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-25 21:22:32,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 688 [2023-08-25 21:22:32,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 391 transitions, 5245 flow. Second operand has 5 states, 5 states have (on average 239.6) internal successors, (1198), 5 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:32,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:22:32,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 688 [2023-08-25 21:22:32,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:22:37,794 INFO L124 PetriNetUnfolderBase]: 26034/38543 cut-off events. [2023-08-25 21:22:37,795 INFO L125 PetriNetUnfolderBase]: For 252826/259055 co-relation queries the response was YES. [2023-08-25 21:22:38,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156583 conditions, 38543 events. 26034/38543 cut-off events. For 252826/259055 co-relation queries the response was YES. Maximal size of possible extension queue 1243. Compared 270071 event pairs, 7179 based on Foata normal form. 1340/35589 useless extension candidates. Maximal degree in co-relation 156538. Up to 30514 conditions per place. [2023-08-25 21:22:38,304 INFO L140 encePairwiseOnDemand]: 681/688 looper letters, 364 selfloop transitions, 17 changer transitions 8/426 dead transitions. [2023-08-25 21:22:38,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 426 transitions, 6185 flow [2023-08-25 21:22:38,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 21:22:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 21:22:38,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1260 transitions. [2023-08-25 21:22:38,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36627906976744184 [2023-08-25 21:22:38,307 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1260 transitions. [2023-08-25 21:22:38,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1260 transitions. [2023-08-25 21:22:38,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:22:38,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1260 transitions. [2023-08-25 21:22:38,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:38,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 688.0) internal successors, (4128), 6 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:38,312 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 688.0) internal successors, (4128), 6 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:38,312 INFO L175 Difference]: Start difference. First operand has 160 places, 391 transitions, 5245 flow. Second operand 5 states and 1260 transitions. [2023-08-25 21:22:38,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 426 transitions, 6185 flow [2023-08-25 21:22:39,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 426 transitions, 6148 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-25 21:22:39,341 INFO L231 Difference]: Finished difference. Result has 161 places, 381 transitions, 5128 flow [2023-08-25 21:22:39,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=5065, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5128, PETRI_PLACES=161, PETRI_TRANSITIONS=381} [2023-08-25 21:22:39,341 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 54 predicate places. [2023-08-25 21:22:39,341 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 381 transitions, 5128 flow [2023-08-25 21:22:39,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 239.6) internal successors, (1198), 5 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:39,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:22:39,342 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:22:39,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-25 21:22:39,543 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,SelfDestructingSolverStorable14 [2023-08-25 21:22:39,543 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 21:22:39,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:22:39,544 INFO L85 PathProgramCache]: Analyzing trace with hash -820054564, now seen corresponding path program 1 times [2023-08-25 21:22:39,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:22:39,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317351550] [2023-08-25 21:22:39,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:22:39,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:22:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:22:40,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 21:22:40,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:22:40,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317351550] [2023-08-25 21:22:40,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317351550] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:22:40,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:22:40,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-25 21:22:40,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709157500] [2023-08-25 21:22:40,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:22:40,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-25 21:22:40,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:22:40,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-25 21:22:40,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-25 21:22:40,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 688 [2023-08-25 21:22:40,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 381 transitions, 5128 flow. Second operand has 8 states, 8 states have (on average 232.5) internal successors, (1860), 8 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:40,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:22:40,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 688 [2023-08-25 21:22:40,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:22:51,456 INFO L124 PetriNetUnfolderBase]: 56793/78132 cut-off events. [2023-08-25 21:22:51,456 INFO L125 PetriNetUnfolderBase]: For 314403/316176 co-relation queries the response was YES. [2023-08-25 21:22:52,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292912 conditions, 78132 events. 56793/78132 cut-off events. For 314403/316176 co-relation queries the response was YES. Maximal size of possible extension queue 2294. Compared 530964 event pairs, 15011 based on Foata normal form. 159/70328 useless extension candidates. Maximal degree in co-relation 292865. Up to 33539 conditions per place. [2023-08-25 21:22:52,469 INFO L140 encePairwiseOnDemand]: 677/688 looper letters, 507 selfloop transitions, 91 changer transitions 0/606 dead transitions. [2023-08-25 21:22:52,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 606 transitions, 8802 flow [2023-08-25 21:22:52,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-25 21:22:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-25 21:22:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1987 transitions. [2023-08-25 21:22:52,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36101017441860467 [2023-08-25 21:22:52,472 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1987 transitions. [2023-08-25 21:22:52,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1987 transitions. [2023-08-25 21:22:52,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:22:52,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1987 transitions. [2023-08-25 21:22:52,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 248.375) internal successors, (1987), 8 states have internal predecessors, (1987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:52,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 688.0) internal successors, (6192), 9 states have internal predecessors, (6192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:52,480 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 688.0) internal successors, (6192), 9 states have internal predecessors, (6192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:52,480 INFO L175 Difference]: Start difference. First operand has 161 places, 381 transitions, 5128 flow. Second operand 8 states and 1987 transitions. [2023-08-25 21:22:52,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 606 transitions, 8802 flow [2023-08-25 21:22:55,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 606 transitions, 8746 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-25 21:22:55,307 INFO L231 Difference]: Finished difference. Result has 165 places, 384 transitions, 5374 flow [2023-08-25 21:22:55,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=5078, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5374, PETRI_PLACES=165, PETRI_TRANSITIONS=384} [2023-08-25 21:22:55,308 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 58 predicate places. [2023-08-25 21:22:55,308 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 384 transitions, 5374 flow [2023-08-25 21:22:55,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 232.5) internal successors, (1860), 8 states have internal predecessors, (1860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:55,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:22:55,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:22:55,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-25 21:22:55,310 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 21:22:55,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:22:55,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1702914880, now seen corresponding path program 2 times [2023-08-25 21:22:55,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:22:55,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320530279] [2023-08-25 21:22:55,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:22:55,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:22:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:22:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 21:22:56,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:22:56,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320530279] [2023-08-25 21:22:56,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320530279] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:22:56,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:22:56,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-25 21:22:56,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154857598] [2023-08-25 21:22:56,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:22:56,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 21:22:56,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:22:56,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 21:22:56,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-25 21:22:56,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 688 [2023-08-25 21:22:56,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 384 transitions, 5374 flow. Second operand has 9 states, 9 states have (on average 230.11111111111111) internal successors, (2071), 9 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:56,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:22:56,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 688 [2023-08-25 21:22:56,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:23:07,428 INFO L124 PetriNetUnfolderBase]: 56896/78318 cut-off events. [2023-08-25 21:23:07,428 INFO L125 PetriNetUnfolderBase]: For 320689/321908 co-relation queries the response was YES. [2023-08-25 21:23:08,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294499 conditions, 78318 events. 56896/78318 cut-off events. For 320689/321908 co-relation queries the response was YES. Maximal size of possible extension queue 2328. Compared 534495 event pairs, 11983 based on Foata normal form. 138/70429 useless extension candidates. Maximal degree in co-relation 294453. Up to 52767 conditions per place. [2023-08-25 21:23:08,413 INFO L140 encePairwiseOnDemand]: 678/688 looper letters, 347 selfloop transitions, 199 changer transitions 0/554 dead transitions. [2023-08-25 21:23:08,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 554 transitions, 8036 flow [2023-08-25 21:23:08,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-25 21:23:08,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-25 21:23:08,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1975 transitions. [2023-08-25 21:23:08,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35882994186046513 [2023-08-25 21:23:08,416 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1975 transitions. [2023-08-25 21:23:08,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1975 transitions. [2023-08-25 21:23:08,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:23:08,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1975 transitions. [2023-08-25 21:23:08,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 246.875) internal successors, (1975), 8 states have internal predecessors, (1975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:23:08,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 688.0) internal successors, (6192), 9 states have internal predecessors, (6192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:23:08,424 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 688.0) internal successors, (6192), 9 states have internal predecessors, (6192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:23:08,424 INFO L175 Difference]: Start difference. First operand has 165 places, 384 transitions, 5374 flow. Second operand 8 states and 1975 transitions. [2023-08-25 21:23:08,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 554 transitions, 8036 flow [2023-08-25 21:23:10,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 554 transitions, 7931 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-25 21:23:10,932 INFO L231 Difference]: Finished difference. Result has 168 places, 385 transitions, 5755 flow [2023-08-25 21:23:10,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=5270, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5755, PETRI_PLACES=168, PETRI_TRANSITIONS=385} [2023-08-25 21:23:10,932 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 61 predicate places. [2023-08-25 21:23:10,932 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 385 transitions, 5755 flow [2023-08-25 21:23:10,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 230.11111111111111) internal successors, (2071), 9 states have internal predecessors, (2071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:23:10,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:23:10,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:23:10,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-25 21:23:10,933 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 21:23:10,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:23:10,933 INFO L85 PathProgramCache]: Analyzing trace with hash 956715521, now seen corresponding path program 1 times [2023-08-25 21:23:10,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:23:10,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388888856] [2023-08-25 21:23:10,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:23:10,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:23:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:23:11,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:23:11,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:23:11,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388888856] [2023-08-25 21:23:11,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388888856] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:23:11,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:23:11,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:23:11,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119274510] [2023-08-25 21:23:11,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:23:11,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:23:11,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:23:11,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:23:11,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:23:11,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 688 [2023-08-25 21:23:11,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 385 transitions, 5755 flow. Second operand has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:23:11,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:23:11,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 688 [2023-08-25 21:23:11,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:23:20,649 INFO L124 PetriNetUnfolderBase]: 48150/66695 cut-off events. [2023-08-25 21:23:20,649 INFO L125 PetriNetUnfolderBase]: For 286801/291615 co-relation queries the response was YES. [2023-08-25 21:23:21,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255885 conditions, 66695 events. 48150/66695 cut-off events. For 286801/291615 co-relation queries the response was YES. Maximal size of possible extension queue 2072. Compared 452882 event pairs, 20102 based on Foata normal form. 1787/61375 useless extension candidates. Maximal degree in co-relation 255838. Up to 61550 conditions per place. [2023-08-25 21:23:21,518 INFO L140 encePairwiseOnDemand]: 683/688 looper letters, 377 selfloop transitions, 4 changer transitions 0/400 dead transitions. [2023-08-25 21:23:21,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 400 transitions, 6547 flow [2023-08-25 21:23:21,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:23:21,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:23:21,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1663 transitions. [2023-08-25 21:23:21,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40285852713178294 [2023-08-25 21:23:21,520 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1663 transitions. [2023-08-25 21:23:21,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1663 transitions. [2023-08-25 21:23:21,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:23:21,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1663 transitions. [2023-08-25 21:23:21,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 277.1666666666667) internal successors, (1663), 6 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:23:21,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:23:21,524 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 688.0) internal successors, (4816), 7 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:23:21,524 INFO L175 Difference]: Start difference. First operand has 168 places, 385 transitions, 5755 flow. Second operand 6 states and 1663 transitions. [2023-08-25 21:23:21,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 400 transitions, 6547 flow [2023-08-25 21:23:24,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 400 transitions, 6212 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-25 21:23:24,502 INFO L231 Difference]: Finished difference. Result has 166 places, 384 transitions, 5426 flow [2023-08-25 21:23:24,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=5418, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5426, PETRI_PLACES=166, PETRI_TRANSITIONS=384} [2023-08-25 21:23:24,502 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 59 predicate places. [2023-08-25 21:23:24,502 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 384 transitions, 5426 flow [2023-08-25 21:23:24,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:23:24,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:23:24,503 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] [2023-08-25 21:23:24,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-25 21:23:24,503 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 21:23:24,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:23:24,503 INFO L85 PathProgramCache]: Analyzing trace with hash -905840664, now seen corresponding path program 3 times [2023-08-25 21:23:24,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:23:24,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204917423] [2023-08-25 21:23:24,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:23:24,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:23:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:23:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 21:23:24,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:23:24,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204917423] [2023-08-25 21:23:24,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204917423] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:23:24,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108132293] [2023-08-25 21:23:24,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 21:23:24,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:23:24,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:23:24,673 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:23:24,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-25 21:23:24,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-25 21:23:24,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 21:23:24,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-25 21:23:24,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:23:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 21:23:25,140 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:23:25,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 21:23:25,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108132293] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:23:25,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:23:25,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-08-25 21:23:25,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497648474] [2023-08-25 21:23:25,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:23:25,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-25 21:23:25,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:23:25,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-25 21:23:25,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-08-25 21:23:25,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 688 [2023-08-25 21:23:25,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 384 transitions, 5426 flow. Second operand has 14 states, 14 states have (on average 252.28571428571428) internal successors, (3532), 14 states have internal predecessors, (3532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:23:25,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:23:25,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 688 [2023-08-25 21:23:25,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:23:33,008 INFO L124 PetriNetUnfolderBase]: 26287/49144 cut-off events. [2023-08-25 21:23:33,009 INFO L125 PetriNetUnfolderBase]: For 456255/465478 co-relation queries the response was YES. [2023-08-25 21:23:33,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191573 conditions, 49144 events. 26287/49144 cut-off events. For 456255/465478 co-relation queries the response was YES. Maximal size of possible extension queue 1806. Compared 475298 event pairs, 5086 based on Foata normal form. 6648/51108 useless extension candidates. Maximal degree in co-relation 191526. Up to 19165 conditions per place. [2023-08-25 21:23:33,689 INFO L140 encePairwiseOnDemand]: 678/688 looper letters, 405 selfloop transitions, 207 changer transitions 0/672 dead transitions. [2023-08-25 21:23:33,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 672 transitions, 10808 flow [2023-08-25 21:23:33,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 21:23:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 21:23:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2357 transitions. [2023-08-25 21:23:33,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38065245478036175 [2023-08-25 21:23:33,692 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2357 transitions. [2023-08-25 21:23:33,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2357 transitions. [2023-08-25 21:23:33,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:23:33,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2357 transitions. [2023-08-25 21:23:33,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 261.8888888888889) internal successors, (2357), 9 states have internal predecessors, (2357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:23:33,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 688.0) internal successors, (6880), 10 states have internal predecessors, (6880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:23:33,698 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 688.0) internal successors, (6880), 10 states have internal predecessors, (6880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:23:33,698 INFO L175 Difference]: Start difference. First operand has 166 places, 384 transitions, 5426 flow. Second operand 9 states and 2357 transitions. [2023-08-25 21:23:33,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 672 transitions, 10808 flow [2023-08-25 21:23:35,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 672 transitions, 10799 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 21:23:35,343 INFO L231 Difference]: Finished difference. Result has 174 places, 578 transitions, 10189 flow [2023-08-25 21:23:35,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=688, PETRI_DIFFERENCE_MINUEND_FLOW=5419, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10189, PETRI_PLACES=174, PETRI_TRANSITIONS=578} [2023-08-25 21:23:35,343 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 67 predicate places. [2023-08-25 21:23:35,344 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 578 transitions, 10189 flow [2023-08-25 21:23:35,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 252.28571428571428) internal successors, (3532), 14 states have internal predecessors, (3532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:23:35,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:23:35,344 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:23:35,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-25 21:23:35,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:23:35,545 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 62 more)] === [2023-08-25 21:23:35,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:23:35,545 INFO L85 PathProgramCache]: Analyzing trace with hash -907894895, now seen corresponding path program 4 times [2023-08-25 21:23:35,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:23:35,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594141541] [2023-08-25 21:23:35,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:23:35,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:23:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:23:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-25 21:23:37,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:23:37,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594141541] [2023-08-25 21:23:37,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594141541] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:23:37,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607703466] [2023-08-25 21:23:37,040 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-25 21:23:37,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:23:37,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:23:37,069 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:23:37,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-25 21:28:24,184 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-25 21:28:24,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 21:28:24,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 99 conjunts are in the unsatisfiable core [2023-08-25 21:28:24,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:28:24,600 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-25 21:28:24,642 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 19 treesize of output 18 [2023-08-25 21:28:24,682 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:28:24,682 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-25 21:28:24,725 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:28:24,725 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2023-08-25 21:28:24,890 INFO L322 Elim1Store]: treesize reduction 168, result has 34.6 percent of original size [2023-08-25 21:28:24,890 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 14 case distinctions, treesize of input 151 treesize of output 157 [2023-08-25 21:28:24,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-25 21:28:24,955 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:29:22,179 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 21:29:34,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-25 21:29:34,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607703466] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:29:34,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:29:34,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 36 [2023-08-25 21:29:34,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834994687] [2023-08-25 21:29:34,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:29:34,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-25 21:29:34,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:29:34,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-25 21:29:34,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1157, Unknown=13, NotChecked=0, Total=1332 [2023-08-25 21:29:34,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 688 [2023-08-25 21:29:34,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 578 transitions, 10189 flow. Second operand has 37 states, 37 states have (on average 211.35135135135135) internal successors, (7820), 37 states have internal predecessors, (7820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:29:34,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:29:34,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 688 [2023-08-25 21:29:34,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:30:12,804 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse32 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse22 (+ .cse32 c_~B~0.offset 1)) (.cse16 (* c_thread2Thread1of1ForFork1_~i~1 4)) (.cse21 (select |c_#race| c_~B~0.base)) (.cse15 (+ 2 .cse32 c_~B~0.offset)) (.cse27 (+ 3 .cse32 c_~B~0.offset))) (let ((.cse10 (store |c_#race| c_~B~0.base (store (store .cse21 .cse15 0) .cse27 0))) (.cse20 (+ .cse32 c_~B~0.offset)) (.cse1 (+ .cse16 c_~C~0.offset)) (.cse2 (+ .cse16 c_~C~0.offset 1)) (.cse6 (+ .cse16 c_~B~0.offset)) (.cse7 (+ .cse16 c_~B~0.offset 1)) (.cse8 (+ .cse16 2 c_~B~0.offset)) (.cse9 (+ .cse16 3 c_~B~0.offset)) (.cse19 (store |c_#race| c_~B~0.base (store (store (store .cse21 .cse22 0) .cse15 0) .cse27 0))) (.cse11 (+ c_~A~0.offset .cse16)) (.cse12 (+ c_~A~0.offset .cse16 1)) (.cse13 (+ c_~A~0.offset .cse16 2)) (.cse14 (+ c_~A~0.offset .cse16 3)) (.cse3 (+ .cse16 2 c_~C~0.offset)) (.cse4 (+ .cse16 3 c_~C~0.offset))) (and (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse0 (let ((.cse5 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse5 c_~B~0.base (store (store (store (store (select .cse5 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (not (= (+ 7 .cse16 c_~C~0.offset) c_~B~0.offset)) (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse17 (let ((.cse18 (store .cse19 ~A~0.base (store (store (store (store (select .cse19 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse18 c_~B~0.base (store (store (store (store (select .cse18 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse17 ~C~0.base (store (store (store (store (select .cse17 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse20) 0)) (not (= (+ c_~B~0.offset 1) .cse1)) (not (= (+ 3 c_~B~0.offset) .cse1)) (= (select .cse21 .cse22) 0) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse23 (let ((.cse24 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse24 c_~B~0.base (store (store (store (store (select .cse24 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse23 ~C~0.base (store (store (store (store (select .cse23 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse20) 0)) (not (= .cse2 c_~B~0.offset)) (not (= c_~B~0.offset .cse1)) (<= 1 c_thread2Thread1of1ForFork1_~i~1) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse25 (let ((.cse26 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse26 c_~B~0.base (store (store (store (store (select .cse26 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse25 ~C~0.base (store (store (store (store (select .cse25 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse27) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse28 (let ((.cse29 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse29 c_~B~0.base (store (store (store (store (select .cse29 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse28 ~C~0.base (store (store (store (store (select .cse28 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse22) 0)) (not (= (+ 2 c_~B~0.offset) .cse1)) (= (select .cse21 .cse20) 0) (not (= (+ .cse16 6 c_~C~0.offset) c_~B~0.offset)) (= c_~B~0.offset 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse30 (let ((.cse31 (store .cse19 ~A~0.base (store (store (store (store (select .cse19 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse31 c_~B~0.base (store (store (store (store (select .cse31 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse30 ~C~0.base (store (store (store (store (select .cse30 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse27) 0)) (= c_~C~0.offset 0) (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (< c_thread1Thread1of1ForFork0_~i~0 c_thread2Thread1of1ForFork1_~i~1) (not (= .cse3 c_~B~0.offset)) (= c_~A~0.offset 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (not (= .cse4 c_~B~0.offset)) (not (= (+ 5 .cse16 c_~C~0.offset) c_~B~0.offset)) (not (= (+ .cse16 c_~C~0.offset 4) c_~B~0.offset)))))) is different from true [2023-08-25 21:30:16,825 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse41 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse16 (* c_thread2Thread1of1ForFork1_~i~1 4)) (.cse22 (+ .cse41 c_~B~0.offset 1)) (.cse21 (select |c_#race| c_~B~0.base)) (.cse15 (+ 2 .cse41 c_~B~0.offset)) (.cse30 (+ 3 .cse41 c_~B~0.offset))) (let ((.cse10 (store |c_#race| c_~B~0.base (store (store .cse21 .cse15 0) .cse30 0))) (.cse20 (+ .cse41 c_~B~0.offset)) (.cse19 (store |c_#race| c_~B~0.base (store (store (store .cse21 .cse22 0) .cse15 0) .cse30 0))) (.cse1 (+ .cse16 c_~C~0.offset)) (.cse2 (+ .cse16 c_~C~0.offset 1)) (.cse3 (+ .cse16 2 c_~C~0.offset)) (.cse4 (+ .cse16 3 c_~C~0.offset)) (.cse6 (+ .cse16 c_~B~0.offset)) (.cse7 (+ .cse16 c_~B~0.offset 1)) (.cse8 (+ .cse16 2 c_~B~0.offset)) (.cse9 (+ .cse16 3 c_~B~0.offset)) (.cse27 (store |c_#race| c_~B~0.base (store .cse21 .cse30 0))) (.cse11 (+ c_~A~0.offset .cse16)) (.cse12 (+ c_~A~0.offset .cse16 1)) (.cse13 (+ c_~A~0.offset .cse16 2)) (.cse14 (+ c_~A~0.offset .cse16 3))) (and (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse0 (let ((.cse5 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse5 c_~B~0.base (store (store (store (store (select .cse5 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (not (= (+ 7 .cse16 c_~C~0.offset) c_~B~0.offset)) (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse17 (let ((.cse18 (store .cse19 ~A~0.base (store (store (store (store (select .cse19 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse18 c_~B~0.base (store (store (store (store (select .cse18 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse17 ~C~0.base (store (store (store (store (select .cse17 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse20) 0)) (not (= (+ c_~B~0.offset 1) .cse1)) (not (= (+ 3 c_~B~0.offset) .cse1)) (= (select .cse21 .cse22) 0) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse23 (let ((.cse24 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse24 c_~B~0.base (store (store (store (store (select .cse24 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse23 ~C~0.base (store (store (store (store (select .cse23 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse20) 0)) (not (= .cse2 c_~B~0.offset)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse25 (let ((.cse26 (store .cse27 ~A~0.base (store (store (store (store (select .cse27 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse26 c_~B~0.base (store (store (store (store (select .cse26 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse25 ~C~0.base (store (store (store (store (select .cse25 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse20) 0)) (not (= c_~B~0.offset .cse1)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse28 (let ((.cse29 (store .cse27 ~A~0.base (store (store (store (store (select .cse27 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse29 c_~B~0.base (store (store (store (store (select .cse29 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse28 ~C~0.base (store (store (store (store (select .cse28 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse30) 0)) (<= 1 c_thread2Thread1of1ForFork1_~i~1) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse31 (let ((.cse32 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse32 c_~B~0.base (store (store (store (store (select .cse32 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse31 ~C~0.base (store (store (store (store (select .cse31 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse30) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse33 (let ((.cse34 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse34 c_~B~0.base (store (store (store (store (select .cse34 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse33 ~C~0.base (store (store (store (store (select .cse33 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse22) 0)) (not (= (+ 2 c_~B~0.offset) .cse1)) (= (select .cse21 .cse20) 0) (not (= (+ .cse16 6 c_~C~0.offset) c_~B~0.offset)) (= c_~B~0.offset 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse35 (let ((.cse36 (store .cse27 ~A~0.base (store (store (store (store (select .cse27 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse36 c_~B~0.base (store (store (store (store (select .cse36 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse35 ~C~0.base (store (store (store (store (select .cse35 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse37 (let ((.cse38 (store .cse19 ~A~0.base (store (store (store (store (select .cse19 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse38 c_~B~0.base (store (store (store (store (select .cse38 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse37 ~C~0.base (store (store (store (store (select .cse37 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse30) 0)) (= c_~C~0.offset 0) (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (< c_thread1Thread1of1ForFork0_~i~0 c_thread2Thread1of1ForFork1_~i~1) (not (= .cse3 c_~B~0.offset)) (= c_~A~0.offset 0) (= (select .cse21 .cse15) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (not (= .cse4 c_~B~0.offset)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse39 (let ((.cse40 (store .cse27 ~A~0.base (store (store (store (store (select .cse27 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse40 c_~B~0.base (store (store (store (store (select .cse40 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse39 ~C~0.base (store (store (store (store (select .cse39 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse22) 0)) (not (= (+ 5 .cse16 c_~C~0.offset) c_~B~0.offset)) (not (= (+ .cse16 c_~C~0.offset 4) c_~B~0.offset)))))) is different from true [2023-08-25 21:30:21,635 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse49 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse16 (* c_thread2Thread1of1ForFork1_~i~1 4)) (.cse23 (+ .cse49 c_~B~0.offset 1)) (.cse21 (select |c_#race| c_~B~0.base)) (.cse15 (+ 2 .cse49 c_~B~0.offset)) (.cse22 (+ 3 .cse49 c_~B~0.offset))) (let ((.cse10 (store |c_#race| c_~B~0.base (store (store .cse21 .cse15 0) .cse22 0))) (.cse20 (+ .cse49 c_~B~0.offset)) (.cse19 (store |c_#race| c_~B~0.base (store (store (store .cse21 .cse23 0) .cse15 0) .cse22 0))) (.cse28 (store |c_#race| c_~B~0.base (store .cse21 .cse22 0))) (.cse1 (+ .cse16 c_~C~0.offset)) (.cse2 (+ .cse16 c_~C~0.offset 1)) (.cse3 (+ .cse16 2 c_~C~0.offset)) (.cse4 (+ .cse16 3 c_~C~0.offset)) (.cse6 (+ .cse16 c_~B~0.offset)) (.cse7 (+ .cse16 c_~B~0.offset 1)) (.cse8 (+ .cse16 2 c_~B~0.offset)) (.cse9 (+ .cse16 3 c_~B~0.offset)) (.cse11 (+ c_~A~0.offset .cse16)) (.cse12 (+ c_~A~0.offset .cse16 1)) (.cse13 (+ c_~A~0.offset .cse16 2)) (.cse14 (+ c_~A~0.offset .cse16 3))) (and (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse0 (let ((.cse5 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse5 c_~B~0.base (store (store (store (store (select .cse5 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (not (= (+ 7 .cse16 c_~C~0.offset) c_~B~0.offset)) (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse17 (let ((.cse18 (store .cse19 ~A~0.base (store (store (store (store (select .cse19 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse18 c_~B~0.base (store (store (store (store (select .cse18 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse17 ~C~0.base (store (store (store (store (select .cse17 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse20) 0)) (= (select .cse21 .cse22) 0) (not (= (+ c_~B~0.offset 1) .cse1)) (not (= (+ 3 c_~B~0.offset) .cse1)) (= (select .cse21 .cse23) 0) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse24 (let ((.cse25 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse25 c_~B~0.base (store (store (store (store (select .cse25 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse24 ~C~0.base (store (store (store (store (select .cse24 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse20) 0)) (not (= .cse2 c_~B~0.offset)) (= (select .cse21 3) 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse26 (let ((.cse27 (store .cse28 ~A~0.base (store (store (store (store (select .cse28 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse27 c_~B~0.base (store (store (store (store (select .cse27 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse26 ~C~0.base (store (store (store (store (select .cse26 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse20) 0)) (not (= c_~B~0.offset .cse1)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse29 (let ((.cse30 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse30 c_~B~0.base (store (store (store (store (select .cse30 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse29 ~C~0.base (store (store (store (store (select .cse29 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse20) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse31 (let ((.cse32 (store .cse28 ~A~0.base (store (store (store (store (select .cse28 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse32 c_~B~0.base (store (store (store (store (select .cse32 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse31 ~C~0.base (store (store (store (store (select .cse31 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse22) 0)) (= (select .cse21 0) 0) (<= 1 c_thread2Thread1of1ForFork1_~i~1) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse33 (let ((.cse34 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse34 c_~B~0.base (store (store (store (store (select .cse34 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse33 ~C~0.base (store (store (store (store (select .cse33 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse22) 0)) (= (select .cse21 1) 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse35 (let ((.cse36 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse36 c_~B~0.base (store (store (store (store (select .cse36 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse35 ~C~0.base (store (store (store (store (select .cse35 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse23) 0)) (not (= (+ 2 c_~B~0.offset) .cse1)) (= (select .cse21 .cse20) 0) (not (= (+ .cse16 6 c_~C~0.offset) c_~B~0.offset)) (= c_~B~0.offset 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse37 (let ((.cse38 (store .cse28 ~A~0.base (store (store (store (store (select .cse28 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse38 c_~B~0.base (store (store (store (store (select .cse38 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse37 ~C~0.base (store (store (store (store (select .cse37 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse39 (let ((.cse40 (store .cse19 ~A~0.base (store (store (store (store (select .cse19 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse40 c_~B~0.base (store (store (store (store (select .cse40 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse39 ~C~0.base (store (store (store (store (select .cse39 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse22) 0)) (= c_~C~0.offset 0) (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|)) (= c_thread1Thread1of1ForFork0_~i~0 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse41 (let ((.cse42 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse42 c_~B~0.base (store (store (store (store (select .cse42 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse41 ~C~0.base (store (store (store (store (select .cse41 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse22) 0)) (< c_thread1Thread1of1ForFork0_~i~0 c_thread2Thread1of1ForFork1_~i~1) (not (= .cse3 c_~B~0.offset)) (= c_~A~0.offset 0) (= (select .cse21 .cse15) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (not (= .cse4 c_~B~0.offset)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse43 (let ((.cse44 (store .cse28 ~A~0.base (store (store (store (store (select .cse28 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse44 c_~B~0.base (store (store (store (store (select .cse44 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse43 ~C~0.base (store (store (store (store (select .cse43 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse23) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse45 (let ((.cse46 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse46 c_~B~0.base (store (store (store (store (select .cse46 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse45 ~C~0.base (store (store (store (store (select .cse45 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse47 (let ((.cse48 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse48 c_~B~0.base (store (store (store (store (select .cse48 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse47 ~C~0.base (store (store (store (store (select .cse47 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse23) 0)) (= (select .cse21 2) 0) (not (= (+ 5 .cse16 c_~C~0.offset) c_~B~0.offset)) (not (= (+ .cse16 c_~C~0.offset 4) c_~B~0.offset)))))) is different from true [2023-08-25 21:30:31,778 WARN L234 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 82 DAG size of output: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:30:36,473 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 [1] [2023-08-25 21:30:38,981 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse41 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse40 (* c_thread2Thread1of1ForFork1_~i~1 4)) (.cse21 (+ .cse41 c_~B~0.offset 1)) (.cse20 (select |c_#race| c_~B~0.base)) (.cse15 (+ 2 .cse41 c_~B~0.offset)) (.cse29 (+ 3 .cse41 c_~B~0.offset))) (let ((.cse10 (store |c_#race| c_~B~0.base (store (store .cse20 .cse15 0) .cse29 0))) (.cse19 (+ .cse41 c_~B~0.offset)) (.cse18 (store |c_#race| c_~B~0.base (store (store (store .cse20 .cse21 0) .cse15 0) .cse29 0))) (.cse1 (+ .cse40 c_~C~0.offset)) (.cse2 (+ .cse40 c_~C~0.offset 1)) (.cse3 (+ .cse40 2 c_~C~0.offset)) (.cse4 (+ .cse40 3 c_~C~0.offset)) (.cse6 (+ .cse40 c_~B~0.offset)) (.cse7 (+ .cse40 c_~B~0.offset 1)) (.cse8 (+ .cse40 2 c_~B~0.offset)) (.cse9 (+ .cse40 3 c_~B~0.offset)) (.cse26 (store |c_#race| c_~B~0.base (store .cse20 .cse29 0))) (.cse11 (+ c_~A~0.offset .cse40)) (.cse12 (+ c_~A~0.offset .cse40 1)) (.cse13 (+ c_~A~0.offset .cse40 2)) (.cse14 (+ c_~A~0.offset .cse40 3))) (and (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse0 (let ((.cse5 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse5 c_~B~0.base (store (store (store (store (select .cse5 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse16 (let ((.cse17 (store .cse18 ~A~0.base (store (store (store (store (select .cse18 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse17 c_~B~0.base (store (store (store (store (select .cse17 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse16 ~C~0.base (store (store (store (store (select .cse16 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse19) 0)) (= (select .cse20 .cse21) 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse22 (let ((.cse23 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse23 c_~B~0.base (store (store (store (store (select .cse23 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse22 ~C~0.base (store (store (store (store (select .cse22 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse19) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse24 (let ((.cse25 (store .cse26 ~A~0.base (store (store (store (store (select .cse26 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse25 c_~B~0.base (store (store (store (store (select .cse25 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse24 ~C~0.base (store (store (store (store (select .cse24 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse19) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse27 (let ((.cse28 (store .cse26 ~A~0.base (store (store (store (store (select .cse26 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse28 c_~B~0.base (store (store (store (store (select .cse28 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse27 ~C~0.base (store (store (store (store (select .cse27 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse29) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse30 (let ((.cse31 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse31 c_~B~0.base (store (store (store (store (select .cse31 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse30 ~C~0.base (store (store (store (store (select .cse30 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse29) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse32 (let ((.cse33 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse33 c_~B~0.base (store (store (store (store (select .cse33 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse32 ~C~0.base (store (store (store (store (select .cse32 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse21) 0)) (= (select .cse20 .cse19) 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse34 (let ((.cse35 (store .cse26 ~A~0.base (store (store (store (store (select .cse26 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse35 c_~B~0.base (store (store (store (store (select .cse35 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse34 ~C~0.base (store (store (store (store (select .cse34 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse36 (let ((.cse37 (store .cse18 ~A~0.base (store (store (store (store (select .cse18 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse37 c_~B~0.base (store (store (store (store (select .cse37 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse36 ~C~0.base (store (store (store (store (select .cse36 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse29) 0)) (< c_thread1Thread1of1ForFork0_~i~0 c_thread2Thread1of1ForFork1_~i~1) (= (select .cse20 .cse15) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse38 (let ((.cse39 (store .cse26 ~A~0.base (store (store (store (store (select .cse26 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse39 c_~B~0.base (store (store (store (store (select .cse39 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse38 ~C~0.base (store (store (store (store (select .cse38 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse21) 0)))))) is different from true [2023-08-25 21:30:42,128 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 [1] [2023-08-25 21:30:44,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:30:46,587 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse31 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse30 (* c_thread2Thread1of1ForFork1_~i~1 4)) (.cse16 (select |c_#race| c_~B~0.base)) (.cse18 (+ .cse31 c_~B~0.offset 1)) (.cse25 (+ 2 .cse31 c_~B~0.offset)) (.cse17 (+ 3 .cse31 c_~B~0.offset))) (let ((.cse15 (+ .cse31 c_~B~0.offset)) (.cse10 (store |c_#race| c_~B~0.base (store (store (store .cse16 .cse18 0) .cse25 0) .cse17 0))) (.cse1 (+ .cse30 c_~C~0.offset)) (.cse2 (+ .cse30 c_~C~0.offset 1)) (.cse3 (+ .cse30 2 c_~C~0.offset)) (.cse4 (+ .cse30 3 c_~C~0.offset)) (.cse6 (+ .cse30 c_~B~0.offset)) (.cse7 (+ .cse30 c_~B~0.offset 1)) (.cse8 (+ .cse30 2 c_~B~0.offset)) (.cse9 (+ .cse30 3 c_~B~0.offset)) (.cse11 (+ c_~A~0.offset .cse30)) (.cse12 (+ c_~A~0.offset .cse30 1)) (.cse13 (+ c_~A~0.offset .cse30 2)) (.cse14 (+ c_~A~0.offset .cse30 3))) (and (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse0 (let ((.cse5 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse5 c_~B~0.base (store (store (store (store (select .cse5 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (= (select .cse16 .cse17) 0) (= (select .cse16 .cse18) 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse19 (let ((.cse20 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse20 c_~B~0.base (store (store (store (store (select .cse20 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse19 ~C~0.base (store (store (store (store (select .cse19 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (= (select .cse16 .cse15) 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse21 (let ((.cse22 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse22 c_~B~0.base (store (store (store (store (select .cse22 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse21 ~C~0.base (store (store (store (store (select .cse21 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse17) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse23 (let ((.cse24 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse24 c_~B~0.base (store (store (store (store (select .cse24 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse23 ~C~0.base (store (store (store (store (select .cse23 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse17) 0)) (< c_thread1Thread1of1ForFork0_~i~0 c_thread2Thread1of1ForFork1_~i~1) (= (select .cse16 .cse25) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse26 (let ((.cse27 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse27 c_~B~0.base (store (store (store (store (select .cse27 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse26 ~C~0.base (store (store (store (store (select .cse26 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse25) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse28 (let ((.cse29 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse29 c_~B~0.base (store (store (store (store (select .cse29 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse28 ~C~0.base (store (store (store (store (select .cse28 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse18) 0)))))) is different from true [2023-08-25 21:30:50,633 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 [1] [2023-08-25 21:31:13,059 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 [1] [2023-08-25 21:31:15,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:31:25,376 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 [1] [2023-08-25 21:31:27,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:31:29,392 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 [1] [2023-08-25 21:31:31,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:31:33,645 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 [1] [2023-08-25 21:31:35,790 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 [1] [2023-08-25 21:31:37,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:31:41,734 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 [1] [2023-08-25 21:31:43,917 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 [1] [2023-08-25 21:31:45,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:31:51,506 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 [1] [2023-08-25 21:31:53,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:31:55,523 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 [1] [2023-08-25 21:31:57,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:31:59,741 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 [1] [2023-08-25 21:32:01,751 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 [1] [2023-08-25 21:32:03,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:32:09,649 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 [1] [2023-08-25 21:32:11,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:32:13,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:32:15,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:32:17,825 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 [1] [2023-08-25 21:32:20,186 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 [1] [2023-08-25 21:32:22,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:32:26,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:32:30,298 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 [1] [2023-08-25 21:32:32,489 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 [1] [2023-08-25 21:32:34,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:32:37,466 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse49 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse48 (* c_thread2Thread1of1ForFork1_~i~1 4)) (.cse22 (+ .cse49 c_~B~0.offset 1)) (.cse20 (select |c_#race| c_~B~0.base)) (.cse15 (+ 2 .cse49 c_~B~0.offset)) (.cse21 (+ 3 .cse49 c_~B~0.offset))) (let ((.cse10 (store |c_#race| c_~B~0.base (store (store .cse20 .cse15 0) .cse21 0))) (.cse19 (+ .cse49 c_~B~0.offset)) (.cse18 (store |c_#race| c_~B~0.base (store (store (store .cse20 .cse22 0) .cse15 0) .cse21 0))) (.cse27 (store |c_#race| c_~B~0.base (store .cse20 .cse21 0))) (.cse1 (+ .cse48 c_~C~0.offset)) (.cse2 (+ .cse48 c_~C~0.offset 1)) (.cse3 (+ .cse48 2 c_~C~0.offset)) (.cse4 (+ .cse48 3 c_~C~0.offset)) (.cse6 (+ .cse48 c_~B~0.offset)) (.cse7 (+ .cse48 c_~B~0.offset 1)) (.cse8 (+ .cse48 2 c_~B~0.offset)) (.cse9 (+ .cse48 3 c_~B~0.offset)) (.cse11 (+ c_~A~0.offset .cse48)) (.cse12 (+ c_~A~0.offset .cse48 1)) (.cse13 (+ c_~A~0.offset .cse48 2)) (.cse14 (+ c_~A~0.offset .cse48 3))) (and (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse0 (let ((.cse5 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse5 c_~B~0.base (store (store (store (store (select .cse5 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse0 ~C~0.base (store (store (store (store (select .cse0 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse16 (let ((.cse17 (store .cse18 ~A~0.base (store (store (store (store (select .cse18 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse17 c_~B~0.base (store (store (store (store (select .cse17 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse16 ~C~0.base (store (store (store (store (select .cse16 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse19) 0)) (= (select .cse20 .cse21) 0) (= (select .cse20 .cse22) 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse23 (let ((.cse24 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse24 c_~B~0.base (store (store (store (store (select .cse24 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse23 ~C~0.base (store (store (store (store (select .cse23 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse19) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse25 (let ((.cse26 (store .cse27 ~A~0.base (store (store (store (store (select .cse27 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse26 c_~B~0.base (store (store (store (store (select .cse26 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse25 ~C~0.base (store (store (store (store (select .cse25 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse19) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse28 (let ((.cse29 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse29 c_~B~0.base (store (store (store (store (select .cse29 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse28 ~C~0.base (store (store (store (store (select .cse28 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse19) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse30 (let ((.cse31 (store .cse27 ~A~0.base (store (store (store (store (select .cse27 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse31 c_~B~0.base (store (store (store (store (select .cse31 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse30 ~C~0.base (store (store (store (store (select .cse30 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse21) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse32 (let ((.cse33 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse33 c_~B~0.base (store (store (store (store (select .cse33 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse32 ~C~0.base (store (store (store (store (select .cse32 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse21) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse34 (let ((.cse35 (store .cse10 ~A~0.base (store (store (store (store (select .cse10 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse35 c_~B~0.base (store (store (store (store (select .cse35 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse34 ~C~0.base (store (store (store (store (select .cse34 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse22) 0)) (= (select .cse20 .cse19) 0) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse36 (let ((.cse37 (store .cse27 ~A~0.base (store (store (store (store (select .cse27 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse37 c_~B~0.base (store (store (store (store (select .cse37 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse36 ~C~0.base (store (store (store (store (select .cse36 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse38 (let ((.cse39 (store .cse18 ~A~0.base (store (store (store (store (select .cse18 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse39 c_~B~0.base (store (store (store (store (select .cse39 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse38 ~C~0.base (store (store (store (store (select .cse38 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse21) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse40 (let ((.cse41 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse41 c_~B~0.base (store (store (store (store (select .cse41 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse40 ~C~0.base (store (store (store (store (select .cse40 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse21) 0)) (< c_thread1Thread1of1ForFork0_~i~0 c_thread2Thread1of1ForFork1_~i~1) (= (select .cse20 .cse15) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse42 (let ((.cse43 (store .cse27 ~A~0.base (store (store (store (store (select .cse27 ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse43 c_~B~0.base (store (store (store (store (select .cse43 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse42 ~C~0.base (store (store (store (store (select .cse42 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse22) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse44 (let ((.cse45 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse45 c_~B~0.base (store (store (store (store (select .cse45 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse44 ~C~0.base (store (store (store (store (select .cse44 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse15) 0)) (forall ((v_ArrVal_1927 Int) (v_ArrVal_1928 Int) (v_ArrVal_1930 Int) (~C~0.base Int) (v_ArrVal_1931 Int) (~A~0.base Int)) (= (select (select (let ((.cse46 (let ((.cse47 (store |c_#race| ~A~0.base (store (store (store (store (select |c_#race| ~A~0.base) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (store .cse47 c_~B~0.base (store (store (store (store (select .cse47 c_~B~0.base) .cse6 0) .cse7 0) .cse8 0) .cse9 0))))) (store .cse46 ~C~0.base (store (store (store (store (select .cse46 ~C~0.base) .cse1 v_ArrVal_1927) .cse2 v_ArrVal_1930) .cse3 v_ArrVal_1928) .cse4 v_ArrVal_1931))) c_~B~0.base) .cse22) 0)))))) is different from true [2023-08-25 21:32:39,471 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 [1] [2023-08-25 21:32:41,882 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 [1] [2023-08-25 21:32:44,096 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 [1] [2023-08-25 21:32:46,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:32:48,193 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 [1] [2023-08-25 21:32:50,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:32:53,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:32:55,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:33:01,517 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 [1] [2023-08-25 21:33:03,712 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 [1] [2023-08-25 21:33:05,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:33:08,907 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 [1] [2023-08-25 21:33:11,105 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 [1] [2023-08-25 21:33:13,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:33:15,207 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 [1] [2023-08-25 21:33:17,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:33:20,011 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 [1] [2023-08-25 21:33:22,023 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 [1] [2023-08-25 21:33:28,677 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 [1] [2023-08-25 21:33:35,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:33:38,364 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 [1] [2023-08-25 21:33:40,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:33:42,666 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 [1] [2023-08-25 21:33:44,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:33:57,846 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 [1] [2023-08-25 21:34:00,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:34:02,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:34:04,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:34:06,810 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 [1] [2023-08-25 21:34:09,016 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 [1] [2023-08-25 21:34:11,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:34:13,087 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 [1] [2023-08-25 21:34:15,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:34:19,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:34:20,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:34:22,929 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 [1] [2023-08-25 21:34:29,601 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 [1] [2023-08-25 21:34:32,074 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 [1] [2023-08-25 21:34:34,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:34:36,150 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 [1] [2023-08-25 21:34:38,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:34:40,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:34:42,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:34:45,285 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 [1] [2023-08-25 21:34:47,482 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 [1] Received shutdown request... [2023-08-25 21:34:48,195 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 21:34:48,195 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 21:34:49,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-25 21:34:49,397 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-25 21:34:49,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-25 21:34:49,414 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (65 of 66 remaining) [2023-08-25 21:34:49,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-25 21:34:49,414 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-25 21:34:49,415 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (64 of 66 remaining) [2023-08-25 21:34:49,415 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (63 of 66 remaining) [2023-08-25 21:34:49,415 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (62 of 66 remaining) [2023-08-25 21:34:49,415 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (61 of 66 remaining) [2023-08-25 21:34:49,416 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (60 of 66 remaining) [2023-08-25 21:34:49,416 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (59 of 66 remaining) [2023-08-25 21:34:49,416 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (58 of 66 remaining) [2023-08-25 21:34:49,416 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (57 of 66 remaining) [2023-08-25 21:34:49,416 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONDATA_RACE (56 of 66 remaining) [2023-08-25 21:34:49,416 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (55 of 66 remaining) [2023-08-25 21:34:49,416 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (54 of 66 remaining) [2023-08-25 21:34:49,416 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (53 of 66 remaining) [2023-08-25 21:34:49,416 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (52 of 66 remaining) [2023-08-25 21:34:49,416 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (51 of 66 remaining) [2023-08-25 21:34:49,416 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (50 of 66 remaining) [2023-08-25 21:34:49,416 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (49 of 66 remaining) [2023-08-25 21:34:49,416 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (48 of 66 remaining) [2023-08-25 21:34:49,416 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (47 of 66 remaining) [2023-08-25 21:34:49,417 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (46 of 66 remaining) [2023-08-25 21:34:49,417 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (45 of 66 remaining) [2023-08-25 21:34:49,417 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (44 of 66 remaining) [2023-08-25 21:34:49,417 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (43 of 66 remaining) [2023-08-25 21:34:49,417 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (42 of 66 remaining) [2023-08-25 21:34:49,417 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 66 remaining) [2023-08-25 21:34:49,417 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 66 remaining) [2023-08-25 21:34:49,417 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 66 remaining) [2023-08-25 21:34:49,417 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (38 of 66 remaining) [2023-08-25 21:34:49,417 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 66 remaining) [2023-08-25 21:34:49,417 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 66 remaining) [2023-08-25 21:34:49,417 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 66 remaining) [2023-08-25 21:34:49,417 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (34 of 66 remaining) [2023-08-25 21:34:49,417 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (33 of 66 remaining) [2023-08-25 21:34:49,417 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (32 of 66 remaining) [2023-08-25 21:34:49,417 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 66 remaining) [2023-08-25 21:34:49,418 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (30 of 66 remaining) [2023-08-25 21:34:49,418 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (29 of 66 remaining) [2023-08-25 21:34:49,418 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (28 of 66 remaining) [2023-08-25 21:34:49,418 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (27 of 66 remaining) [2023-08-25 21:34:49,418 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (26 of 66 remaining) [2023-08-25 21:34:49,418 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONASSERT (25 of 66 remaining) [2023-08-25 21:34:49,418 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 66 remaining) [2023-08-25 21:34:49,418 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 66 remaining) [2023-08-25 21:34:49,418 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 66 remaining) [2023-08-25 21:34:49,418 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (21 of 66 remaining) [2023-08-25 21:34:49,419 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (20 of 66 remaining) [2023-08-25 21:34:49,419 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (19 of 66 remaining) [2023-08-25 21:34:49,419 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 66 remaining) [2023-08-25 21:34:49,419 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (17 of 66 remaining) [2023-08-25 21:34:49,419 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (16 of 66 remaining) [2023-08-25 21:34:49,419 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (15 of 66 remaining) [2023-08-25 21:34:49,419 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONDATA_RACE (14 of 66 remaining) [2023-08-25 21:34:49,419 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (13 of 66 remaining) [2023-08-25 21:34:49,419 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (12 of 66 remaining) [2023-08-25 21:34:49,419 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (11 of 66 remaining) [2023-08-25 21:34:49,420 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (10 of 66 remaining) [2023-08-25 21:34:49,420 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 66 remaining) [2023-08-25 21:34:49,420 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (8 of 66 remaining) [2023-08-25 21:34:49,420 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (7 of 66 remaining) [2023-08-25 21:34:49,420 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (6 of 66 remaining) [2023-08-25 21:34:49,420 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 66 remaining) [2023-08-25 21:34:49,420 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 66 remaining) [2023-08-25 21:34:49,420 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 66 remaining) [2023-08-25 21:34:49,420 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 66 remaining) [2023-08-25 21:34:49,420 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 66 remaining) [2023-08-25 21:34:49,421 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 66 remaining) [2023-08-25 21:34:49,421 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:34:49,427 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 21:34:49,427 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 21:34:49,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 09:34:49 BasicIcfg [2023-08-25 21:34:49,430 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 21:34:49,430 INFO L158 Benchmark]: Toolchain (without parser) took 823875.92ms. Allocated memory was 367.0MB in the beginning and 15.7GB in the end (delta: 15.3GB). Free memory was 324.2MB in the beginning and 13.5GB in the end (delta: -13.1GB). Peak memory consumption was 2.3GB. Max. memory is 16.0GB. [2023-08-25 21:34:49,431 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 367.0MB. Free memory was 345.0MB in the beginning and 344.9MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 21:34:49,431 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.96ms. Allocated memory is still 367.0MB. Free memory was 323.1MB in the beginning and 311.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-25 21:34:49,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.47ms. Allocated memory is still 367.0MB. Free memory was 310.5MB in the beginning and 308.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 21:34:49,431 INFO L158 Benchmark]: Boogie Preprocessor took 76.92ms. Allocated memory is still 367.0MB. Free memory was 308.4MB in the beginning and 305.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 21:34:49,431 INFO L158 Benchmark]: RCFGBuilder took 808.10ms. Allocated memory is still 367.0MB. Free memory was 305.3MB in the beginning and 256.0MB in the end (delta: 49.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.0GB. [2023-08-25 21:34:49,432 INFO L158 Benchmark]: TraceAbstraction took 822609.12ms. Allocated memory was 367.0MB in the beginning and 15.7GB in the end (delta: 15.3GB). Free memory was 255.0MB in the beginning and 13.5GB in the end (delta: -13.2GB). Peak memory consumption was 2.2GB. Max. memory is 16.0GB. [2023-08-25 21:34:49,435 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.18ms. Allocated memory is still 367.0MB. Free memory was 345.0MB in the beginning and 344.9MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 302.96ms. Allocated memory is still 367.0MB. Free memory was 323.1MB in the beginning and 311.6MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 73.47ms. Allocated memory is still 367.0MB. Free memory was 310.5MB in the beginning and 308.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 76.92ms. Allocated memory is still 367.0MB. Free memory was 308.4MB in the beginning and 305.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 808.10ms. Allocated memory is still 367.0MB. Free memory was 305.3MB in the beginning and 256.0MB in the end (delta: 49.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.0GB. * TraceAbstraction took 822609.12ms. Allocated memory was 367.0MB in the beginning and 15.7GB in the end (delta: 15.3GB). Free memory was 255.0MB in the beginning and 13.5GB in the end (delta: -13.2GB). Peak memory consumption was 2.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.9s, 330 PlacesBefore, 107 PlacesAfterwards, 340 TransitionsBefore, 107 TransitionsAfterwards, 9904 CoEnabledTransitionPairs, 8 FixpointIterations, 204 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 30 TrivialYvCompositions, 11 ConcurrentYvCompositions, 10 ChoiceCompositions, 334 TotalNumberOfCompositions, 61334 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16985, independent: 15876, independent conditional: 0, independent unconditional: 15876, dependent: 1109, dependent conditional: 0, dependent unconditional: 1109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5292, independent: 5132, independent conditional: 0, independent unconditional: 5132, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 16985, independent: 10744, independent conditional: 0, independent unconditional: 10744, dependent: 949, dependent conditional: 0, dependent unconditional: 949, unknown: 5292, unknown conditional: 0, unknown unconditional: 5292] , Statistics on independence cache: Total cache size (in pairs): 1019, Positive cache size: 924, Positive conditional cache size: 0, Positive unconditional cache size: 924, Negative cache size: 95, Negative conditional cache size: 0, Negative unconditional cache size: 95, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 430 locations, 66 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: 822.5s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 439.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.2s, HoareTripleCheckerStatistics: 67 mSolverCounterUnknown, 3292 SdHoareTripleChecker+Valid, 244.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3292 mSDsluCounter, 885 SdHoareTripleChecker+Invalid, 241.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2724 IncrementalHoareTripleChecker+Unchecked, 578 mSDsCounter, 559 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8421 IncrementalHoareTripleChecker+Invalid, 11772 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 559 mSolverCounterUnsat, 307 mSDtfsCounter, 8421 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 212 SyntacticMatches, 3 SemanticMatches, 205 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 127.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10189occurred in iteration=19, InterpolantAutomatonStates: 122, 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, 287.6s SatisfiabilityAnalysisTime, 79.4s InterpolantComputationTime, 603 NumberOfCodeBlocks, 597 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 683 ConstructedInterpolants, 6 QuantifiedInterpolants, 14482 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1776 ConjunctsInSsa, 180 ConjunctsInUnsatCore, 27 InterpolantComputations, 18 PerfectInterpolantSequences, 76/99 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