/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 04:30:29,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 04:30:29,998 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-25 04:30:30,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 04:30:30,004 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 04:30:30,035 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 04:30:30,036 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 04:30:30,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 04:30:30,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 04:30:30,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 04:30:30,046 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 04:30:30,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 04:30:30,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 04:30:30,048 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 04:30:30,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 04:30:30,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 04:30:30,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 04:30:30,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 04:30:30,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 04:30:30,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 04:30:30,049 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 04:30:30,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 04:30:30,050 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 04:30:30,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 04:30:30,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 04:30:30,051 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 04:30:30,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 04:30:30,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 04:30:30,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 04:30:30,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 04:30:30,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 04:30:30,053 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 04:30:30,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 04:30:30,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 04:30:30,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 04:30:30,054 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 04:30:30,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 04:30:30,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 04:30:30,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 04:30:30,423 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 04:30:30,424 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 04:30:30,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i [2023-08-25 04:30:31,594 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 04:30:31,894 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 04:30:31,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_17-traces-rpb-litmus_unknown_1_neg.i [2023-08-25 04:30:31,906 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/275973eb2/09af93d071ce43c2b8a9e809cf3ddb36/FLAG4c9b53c5a [2023-08-25 04:30:31,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/275973eb2/09af93d071ce43c2b8a9e809cf3ddb36 [2023-08-25 04:30:31,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 04:30:31,921 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 04:30:31,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 04:30:31,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 04:30:31,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 04:30:31,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 04:30:31" (1/1) ... [2023-08-25 04:30:31,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a702b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:30:31, skipping insertion in model container [2023-08-25 04:30:31,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 04:30:31" (1/1) ... [2023-08-25 04:30:31,961 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 04:30:32,243 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 04:30:32,258 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 04:30:32,285 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [232] [2023-08-25 04:30:32,287 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [233] [2023-08-25 04:30:32,316 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 04:30:32,360 INFO L206 MainTranslator]: Completed translation [2023-08-25 04:30:32,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:30:32 WrapperNode [2023-08-25 04:30:32,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 04:30:32,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 04:30:32,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 04:30:32,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 04:30:32,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:30:32" (1/1) ... [2023-08-25 04:30:32,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:30:32" (1/1) ... [2023-08-25 04:30:32,419 INFO L138 Inliner]: procedures = 163, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2023-08-25 04:30:32,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 04:30:32,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 04:30:32,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 04:30:32,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 04:30:32,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:30:32" (1/1) ... [2023-08-25 04:30:32,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:30:32" (1/1) ... [2023-08-25 04:30:32,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:30:32" (1/1) ... [2023-08-25 04:30:32,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:30:32" (1/1) ... [2023-08-25 04:30:32,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:30:32" (1/1) ... [2023-08-25 04:30:32,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:30:32" (1/1) ... [2023-08-25 04:30:32,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:30:32" (1/1) ... [2023-08-25 04:30:32,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:30:32" (1/1) ... [2023-08-25 04:30:32,459 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 04:30:32,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 04:30:32,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 04:30:32,460 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 04:30:32,461 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:30:32" (1/1) ... [2023-08-25 04:30:32,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 04:30:32,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:30:32,496 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-25 04:30:32,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-25 04:30:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 04:30:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-25 04:30:32,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 04:30:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 04:30:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-25 04:30:32,535 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-25 04:30:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 04:30:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 04:30:32,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 04:30:32,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 04:30:32,537 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 04:30:32,690 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 04:30:32,692 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 04:30:32,908 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 04:30:32,914 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 04:30:32,915 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-25 04:30:32,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 04:30:32 BoogieIcfgContainer [2023-08-25 04:30:32,923 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 04:30:32,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 04:30:32,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 04:30:32,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 04:30:32,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 04:30:31" (1/3) ... [2023-08-25 04:30:32,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48443343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 04:30:32, skipping insertion in model container [2023-08-25 04:30:32,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:30:32" (2/3) ... [2023-08-25 04:30:32,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48443343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 04:30:32, skipping insertion in model container [2023-08-25 04:30:32,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 04:30:32" (3/3) ... [2023-08-25 04:30:32,933 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_17-traces-rpb-litmus_unknown_1_neg.i [2023-08-25 04:30:32,948 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 04:30:32,949 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-08-25 04:30:32,949 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 04:30:33,008 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-25 04:30:33,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 90 transitions, 185 flow [2023-08-25 04:30:33,105 INFO L124 PetriNetUnfolderBase]: 3/89 cut-off events. [2023-08-25 04:30:33,105 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 04:30:33,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 89 events. 3/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 95 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-08-25 04:30:33,125 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 90 transitions, 185 flow [2023-08-25 04:30:33,129 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 89 transitions, 181 flow [2023-08-25 04:30:33,131 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 04:30:33,140 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 89 transitions, 181 flow [2023-08-25 04:30:33,143 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 89 transitions, 181 flow [2023-08-25 04:30:33,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 89 transitions, 181 flow [2023-08-25 04:30:33,162 INFO L124 PetriNetUnfolderBase]: 3/89 cut-off events. [2023-08-25 04:30:33,162 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 04:30:33,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 89 events. 3/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 95 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2023-08-25 04:30:33,164 INFO L119 LiptonReduction]: Number of co-enabled transitions 1200 [2023-08-25 04:30:35,562 INFO L134 LiptonReduction]: Checked pairs total: 4044 [2023-08-25 04:30:35,563 INFO L136 LiptonReduction]: Total number of compositions: 76 [2023-08-25 04:30:35,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 04:30:35,581 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;@7170d6c8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 04:30:35,581 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-25 04:30:35,585 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 04:30:35,586 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2023-08-25 04:30:35,586 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 04:30:35,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:30:35,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-25 04:30:35,587 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT (and 3 more)] === [2023-08-25 04:30:35,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:30:35,591 INFO L85 PathProgramCache]: Analyzing trace with hash 629093277, now seen corresponding path program 1 times [2023-08-25 04:30:35,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:30:35,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425293821] [2023-08-25 04:30:35,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:30:35,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:30:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:30:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:30:35,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:30:35,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425293821] [2023-08-25 04:30:35,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425293821] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:30:35,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:30:35,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 04:30:35,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412383444] [2023-08-25 04:30:35,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:30:35,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 04:30:35,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:30:35,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 04:30:35,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 04:30:35,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 166 [2023-08-25 04:30:35,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:35,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:30:35,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 166 [2023-08-25 04:30:35,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:30:35,917 INFO L124 PetriNetUnfolderBase]: 117/278 cut-off events. [2023-08-25 04:30:35,918 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 04:30:35,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 278 events. 117/278 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1328 event pairs, 51 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 536. Up to 168 conditions per place. [2023-08-25 04:30:35,921 INFO L140 encePairwiseOnDemand]: 160/166 looper letters, 33 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2023-08-25 04:30:35,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 155 flow [2023-08-25 04:30:35,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 04:30:35,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 04:30:35,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2023-08-25 04:30:35,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5441767068273092 [2023-08-25 04:30:35,934 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 271 transitions. [2023-08-25 04:30:35,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 271 transitions. [2023-08-25 04:30:35,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:30:35,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 271 transitions. [2023-08-25 04:30:35,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:35,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:35,945 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:35,946 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 59 flow. Second operand 3 states and 271 transitions. [2023-08-25 04:30:35,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 155 flow [2023-08-25 04:30:35,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 39 transitions, 154 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 04:30:35,949 INFO L231 Difference]: Finished difference. Result has 33 places, 29 transitions, 82 flow [2023-08-25 04:30:35,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=33, PETRI_TRANSITIONS=29} [2023-08-25 04:30:35,954 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2023-08-25 04:30:35,954 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 29 transitions, 82 flow [2023-08-25 04:30:35,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:35,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:30:35,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:30:35,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 04:30:35,955 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT (and 3 more)] === [2023-08-25 04:30:35,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:30:35,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1972944589, now seen corresponding path program 1 times [2023-08-25 04:30:35,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:30:35,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801510184] [2023-08-25 04:30:35,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:30:35,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:30:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:30:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:30:36,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:30:36,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801510184] [2023-08-25 04:30:36,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801510184] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:30:36,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:30:36,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 04:30:36,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831701148] [2023-08-25 04:30:36,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:30:36,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 04:30:36,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:30:36,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 04:30:36,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 04:30:36,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 166 [2023-08-25 04:30:36,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 29 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:36,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:30:36,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 166 [2023-08-25 04:30:36,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:30:36,170 INFO L124 PetriNetUnfolderBase]: 110/340 cut-off events. [2023-08-25 04:30:36,171 INFO L125 PetriNetUnfolderBase]: For 61/62 co-relation queries the response was YES. [2023-08-25 04:30:36,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 340 events. 110/340 cut-off events. For 61/62 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1825 event pairs, 57 based on Foata normal form. 1/324 useless extension candidates. Maximal degree in co-relation 690. Up to 148 conditions per place. [2023-08-25 04:30:36,173 INFO L140 encePairwiseOnDemand]: 162/166 looper letters, 30 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2023-08-25 04:30:36,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 180 flow [2023-08-25 04:30:36,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 04:30:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 04:30:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2023-08-25 04:30:36,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5582329317269076 [2023-08-25 04:30:36,176 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 278 transitions. [2023-08-25 04:30:36,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 278 transitions. [2023-08-25 04:30:36,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:30:36,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 278 transitions. [2023-08-25 04:30:36,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:36,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:36,179 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:36,179 INFO L175 Difference]: Start difference. First operand has 33 places, 29 transitions, 82 flow. Second operand 3 states and 278 transitions. [2023-08-25 04:30:36,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 180 flow [2023-08-25 04:30:36,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 04:30:36,182 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 92 flow [2023-08-25 04:30:36,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2023-08-25 04:30:36,183 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2023-08-25 04:30:36,183 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 92 flow [2023-08-25 04:30:36,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:36,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:30:36,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:30:36,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 04:30:36,184 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT (and 3 more)] === [2023-08-25 04:30:36,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:30:36,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1972933533, now seen corresponding path program 1 times [2023-08-25 04:30:36,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:30:36,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971062153] [2023-08-25 04:30:36,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:30:36,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:30:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:30:36,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:30:36,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:30:36,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971062153] [2023-08-25 04:30:36,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971062153] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:30:36,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:30:36,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 04:30:36,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512743905] [2023-08-25 04:30:36,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:30:36,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 04:30:36,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:30:36,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 04:30:36,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 04:30:36,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 166 [2023-08-25 04:30:36,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:36,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:30:36,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 166 [2023-08-25 04:30:36,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:30:36,327 INFO L124 PetriNetUnfolderBase]: 194/481 cut-off events. [2023-08-25 04:30:36,327 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2023-08-25 04:30:36,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 481 events. 194/481 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2592 event pairs, 143 based on Foata normal form. 0/415 useless extension candidates. Maximal degree in co-relation 1067. Up to 409 conditions per place. [2023-08-25 04:30:36,331 INFO L140 encePairwiseOnDemand]: 161/166 looper letters, 32 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2023-08-25 04:30:36,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 186 flow [2023-08-25 04:30:36,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 04:30:36,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 04:30:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2023-08-25 04:30:36,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5140562248995983 [2023-08-25 04:30:36,334 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 256 transitions. [2023-08-25 04:30:36,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 256 transitions. [2023-08-25 04:30:36,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:30:36,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 256 transitions. [2023-08-25 04:30:36,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:36,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:36,337 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:36,337 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 92 flow. Second operand 3 states and 256 transitions. [2023-08-25 04:30:36,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 186 flow [2023-08-25 04:30:36,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 04:30:36,339 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 118 flow [2023-08-25 04:30:36,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2023-08-25 04:30:36,340 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2023-08-25 04:30:36,340 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 118 flow [2023-08-25 04:30:36,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:36,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:30:36,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:30:36,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 04:30:36,341 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT (and 3 more)] === [2023-08-25 04:30:36,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:30:36,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1981485192, now seen corresponding path program 1 times [2023-08-25 04:30:36,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:30:36,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234779152] [2023-08-25 04:30:36,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:30:36,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:30:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:30:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:30:36,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:30:36,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234779152] [2023-08-25 04:30:36,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234779152] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:30:36,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:30:36,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 04:30:36,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445992309] [2023-08-25 04:30:36,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:30:36,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 04:30:36,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:30:36,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 04:30:36,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 04:30:36,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 166 [2023-08-25 04:30:36,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:36,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:30:36,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 166 [2023-08-25 04:30:36,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:30:36,477 INFO L124 PetriNetUnfolderBase]: 184/462 cut-off events. [2023-08-25 04:30:36,477 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2023-08-25 04:30:36,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1119 conditions, 462 events. 184/462 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2475 event pairs, 98 based on Foata normal form. 0/431 useless extension candidates. Maximal degree in co-relation 1106. Up to 375 conditions per place. [2023-08-25 04:30:36,480 INFO L140 encePairwiseOnDemand]: 160/166 looper letters, 39 selfloop transitions, 7 changer transitions 4/52 dead transitions. [2023-08-25 04:30:36,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 52 transitions, 284 flow [2023-08-25 04:30:36,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 04:30:36,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 04:30:36,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 269 transitions. [2023-08-25 04:30:36,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5401606425702812 [2023-08-25 04:30:36,481 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 269 transitions. [2023-08-25 04:30:36,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 269 transitions. [2023-08-25 04:30:36,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:30:36,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 269 transitions. [2023-08-25 04:30:36,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:36,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:36,484 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:36,484 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 118 flow. Second operand 3 states and 269 transitions. [2023-08-25 04:30:36,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 52 transitions, 284 flow [2023-08-25 04:30:36,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 52 transitions, 268 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-25 04:30:36,487 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 153 flow [2023-08-25 04:30:36,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2023-08-25 04:30:36,488 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2023-08-25 04:30:36,488 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 153 flow [2023-08-25 04:30:36,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:36,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:30:36,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:30:36,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 04:30:36,489 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT (and 3 more)] === [2023-08-25 04:30:36,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:30:36,490 INFO L85 PathProgramCache]: Analyzing trace with hash -2132526946, now seen corresponding path program 1 times [2023-08-25 04:30:36,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:30:36,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679383670] [2023-08-25 04:30:36,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:30:36,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:30:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:30:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:30:36,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:30:36,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679383670] [2023-08-25 04:30:36,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679383670] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:30:36,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:30:36,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 04:30:36,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856010034] [2023-08-25 04:30:36,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:30:36,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 04:30:36,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:30:36,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 04:30:36,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 04:30:36,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 166 [2023-08-25 04:30:36,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:36,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:30:36,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 166 [2023-08-25 04:30:36,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:30:36,619 INFO L124 PetriNetUnfolderBase]: 92/269 cut-off events. [2023-08-25 04:30:36,619 INFO L125 PetriNetUnfolderBase]: For 99/107 co-relation queries the response was YES. [2023-08-25 04:30:36,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 269 events. 92/269 cut-off events. For 99/107 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1280 event pairs, 20 based on Foata normal form. 11/272 useless extension candidates. Maximal degree in co-relation 653. Up to 154 conditions per place. [2023-08-25 04:30:36,623 INFO L140 encePairwiseOnDemand]: 159/166 looper letters, 23 selfloop transitions, 6 changer transitions 15/50 dead transitions. [2023-08-25 04:30:36,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 272 flow [2023-08-25 04:30:36,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 04:30:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 04:30:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2023-08-25 04:30:36,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020080321285141 [2023-08-25 04:30:36,630 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 250 transitions. [2023-08-25 04:30:36,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 250 transitions. [2023-08-25 04:30:36,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:30:36,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 250 transitions. [2023-08-25 04:30:36,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:36,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:36,633 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:36,633 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 153 flow. Second operand 3 states and 250 transitions. [2023-08-25 04:30:36,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 272 flow [2023-08-25 04:30:36,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 50 transitions, 246 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-25 04:30:36,637 INFO L231 Difference]: Finished difference. Result has 37 places, 30 transitions, 120 flow [2023-08-25 04:30:36,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=166, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=37, PETRI_TRANSITIONS=30} [2023-08-25 04:30:36,640 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2023-08-25 04:30:36,640 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 30 transitions, 120 flow [2023-08-25 04:30:36,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 04:30:36,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:30:36,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:30:36,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 04:30:36,641 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT (and 3 more)] === [2023-08-25 04:30:36,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:30:36,641 INFO L85 PathProgramCache]: Analyzing trace with hash -517209272, now seen corresponding path program 1 times [2023-08-25 04:30:36,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:30:36,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675098483] [2023-08-25 04:30:36,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:30:36,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:30:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 04:30:36,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-25 04:30:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 04:30:36,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-25 04:30:36,705 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-25 04:30:36,706 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONASSERT (5 of 6 remaining) [2023-08-25 04:30:36,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2023-08-25 04:30:36,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2023-08-25 04:30:36,708 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-25 04:30:36,709 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2023-08-25 04:30:36,711 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2023-08-25 04:30:36,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 04:30:36,712 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-25 04:30:36,718 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 04:30:36,718 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 04:30:36,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 04:30:36 BasicIcfg [2023-08-25 04:30:36,749 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 04:30:36,749 INFO L158 Benchmark]: Toolchain (without parser) took 4828.23ms. Allocated memory was 331.4MB in the beginning and 419.4MB in the end (delta: 88.1MB). Free memory was 306.1MB in the beginning and 348.1MB in the end (delta: -42.0MB). Peak memory consumption was 46.5MB. Max. memory is 16.0GB. [2023-08-25 04:30:36,751 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 331.4MB. Free memory was 307.9MB in the beginning and 307.8MB in the end (delta: 144.5kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 04:30:36,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.48ms. Allocated memory is still 331.4MB. Free memory was 306.1MB in the beginning and 286.7MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-25 04:30:36,757 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.45ms. Allocated memory is still 331.4MB. Free memory was 286.7MB in the beginning and 284.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 04:30:36,757 INFO L158 Benchmark]: Boogie Preprocessor took 38.28ms. Allocated memory is still 331.4MB. Free memory was 284.7MB in the beginning and 283.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 04:30:36,757 INFO L158 Benchmark]: RCFGBuilder took 464.72ms. Allocated memory is still 331.4MB. Free memory was 283.1MB in the beginning and 269.6MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-25 04:30:36,757 INFO L158 Benchmark]: TraceAbstraction took 3821.95ms. Allocated memory was 331.4MB in the beginning and 419.4MB in the end (delta: 88.1MB). Free memory was 268.8MB in the beginning and 348.1MB in the end (delta: -79.3MB). Peak memory consumption was 10.9MB. Max. memory is 16.0GB. [2023-08-25 04:30:36,759 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.13ms. Allocated memory is still 331.4MB. Free memory was 307.9MB in the beginning and 307.8MB in the end (delta: 144.5kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 438.48ms. Allocated memory is still 331.4MB. Free memory was 306.1MB in the beginning and 286.7MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 58.45ms. Allocated memory is still 331.4MB. Free memory was 286.7MB in the beginning and 284.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.28ms. Allocated memory is still 331.4MB. Free memory was 284.7MB in the beginning and 283.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 464.72ms. Allocated memory is still 331.4MB. Free memory was 283.1MB in the beginning and 269.6MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * TraceAbstraction took 3821.95ms. Allocated memory was 331.4MB in the beginning and 419.4MB in the end (delta: 88.1MB). Free memory was 268.8MB in the beginning and 348.1MB in the end (delta: -79.3MB). Peak memory consumption was 10.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 232]: Unsoundness Warning unspecified type, defaulting to int C: short [232] - GenericResultAtLocation [Line: 233]: Unsoundness Warning unspecified type, defaulting to int C: short [233] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 90 PlacesBefore, 30 PlacesAfterwards, 89 TransitionsBefore, 28 TransitionsAfterwards, 1200 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 4044 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1402, independent: 1142, independent conditional: 0, independent unconditional: 1142, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 602, independent: 564, independent conditional: 0, independent unconditional: 564, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1402, independent: 578, independent conditional: 0, independent unconditional: 578, dependent: 222, dependent conditional: 0, dependent unconditional: 222, unknown: 602, unknown conditional: 0, unknown unconditional: 602] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 45, Positive conditional cache size: 0, Positive unconditional cache size: 45, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L682] 0 int g = 42; [L683] 0 pthread_mutex_t A = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L684] 0 pthread_mutex_t B = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L694] 0 int r = __VERIFIER_nondet_int(); [L695] 0 int t; [L696] 0 pthread_t id; [L697] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [A={3:0}, B={4:0}, arg={0:0}, g=42, id={5:0}, pthread_create(&id, ((void *)0), t_fun, ((void *)0))=-1, r=1] [L700] COND TRUE 0 \read(r) [L701] 0 g = 17 [L705] 0 t = g [L706] CALL 0 __VERIFIER_assert(!(t == 17)) [L19] COND TRUE 0 !(cond) [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "36-apron_17-traces-rpb-litmus_unknown_1_neg.c", 3, __extension__ __PRETTY_FUNCTION__) VAL [A={3:0}, B={4:0}, arg={0:0}, g=17] - UnprovableResult [Line: 705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 688]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 105 locations, 6 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: 3.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 243 IncrementalHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 15 mSDtfsCounter, 243 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=4, InterpolantAutomatonStates: 15, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 56 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! [2023-08-25 04:30:36,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...