/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/bench-exp1x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 18:45:39,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 18:45:39,827 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 18:45:39,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 18:45:39,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 18:45:39,865 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 18:45:39,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 18:45:39,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 18:45:39,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 18:45:39,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 18:45:39,871 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 18:45:39,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 18:45:39,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 18:45:39,873 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 18:45:39,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 18:45:39,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 18:45:39,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 18:45:39,874 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 18:45:39,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 18:45:39,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 18:45:39,874 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 18:45:39,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 18:45:39,875 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 18:45:39,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 18:45:39,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 18:45:39,876 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 18:45:39,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 18:45:39,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 18:45:39,877 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 18:45:39,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 18:45:39,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 18:45:39,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 18:45:39,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 18:45:39,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 18:45:39,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 18:45:39,879 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 18:45:40,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 18:45:40,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 18:45:40,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 18:45:40,250 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 18:45:40,251 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 18:45:40,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-08-25 18:45:41,443 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 18:45:41,646 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 18:45:41,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-08-25 18:45:41,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d6e9d7a9/2d265bc9aa484c2b93a6b37997a588fb/FLAGfcd9065e9 [2023-08-25 18:45:41,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d6e9d7a9/2d265bc9aa484c2b93a6b37997a588fb [2023-08-25 18:45:41,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 18:45:41,669 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 18:45:41,670 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 18:45:41,670 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 18:45:41,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 18:45:41,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 06:45:41" (1/1) ... [2023-08-25 18:45:41,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f56eea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:45:41, skipping insertion in model container [2023-08-25 18:45:41,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 06:45:41" (1/1) ... [2023-08-25 18:45:41,691 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 18:45:41,822 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 18:45:41,831 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 18:45:41,849 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 18:45:41,861 INFO L206 MainTranslator]: Completed translation [2023-08-25 18:45:41,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:45:41 WrapperNode [2023-08-25 18:45:41,862 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 18:45:41,863 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 18:45:41,863 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 18:45:41,863 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 18:45:41,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:45:41" (1/1) ... [2023-08-25 18:45:41,875 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:45:41" (1/1) ... [2023-08-25 18:45:41,901 INFO L138 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 98 [2023-08-25 18:45:41,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 18:45:41,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 18:45:41,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 18:45:41,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 18:45:41,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:45:41" (1/1) ... [2023-08-25 18:45:41,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:45:41" (1/1) ... [2023-08-25 18:45:41,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:45:41" (1/1) ... [2023-08-25 18:45:41,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:45:41" (1/1) ... [2023-08-25 18:45:41,931 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:45:41" (1/1) ... [2023-08-25 18:45:41,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:45:41" (1/1) ... [2023-08-25 18:45:41,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:45:41" (1/1) ... [2023-08-25 18:45:41,936 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:45:41" (1/1) ... [2023-08-25 18:45:41,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 18:45:41,939 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 18:45:41,939 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 18:45:41,939 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 18:45:41,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:45:41" (1/1) ... [2023-08-25 18:45:41,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 18:45:41,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 18:45:41,978 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 18:45:42,009 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 18:45:42,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 18:45:42,021 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 18:45:42,021 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 18:45:42,021 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 18:45:42,022 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 18:45:42,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 18:45:42,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 18:45:42,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 18:45:42,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 18:45:42,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 18:45:42,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 18:45:42,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 18:45:42,024 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 18:45:42,138 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 18:45:42,140 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 18:45:42,360 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 18:45:42,370 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 18:45:42,370 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-25 18:45:42,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 06:45:42 BoogieIcfgContainer [2023-08-25 18:45:42,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 18:45:42,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 18:45:42,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 18:45:42,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 18:45:42,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 06:45:41" (1/3) ... [2023-08-25 18:45:42,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669214b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 06:45:42, skipping insertion in model container [2023-08-25 18:45:42,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:45:41" (2/3) ... [2023-08-25 18:45:42,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669214b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 06:45:42, skipping insertion in model container [2023-08-25 18:45:42,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 06:45:42" (3/3) ... [2023-08-25 18:45:42,379 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2023-08-25 18:45:42,391 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 18:45:42,392 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2023-08-25 18:45:42,392 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 18:45:42,484 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-25 18:45:42,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 159 transitions, 334 flow [2023-08-25 18:45:42,576 INFO L124 PetriNetUnfolderBase]: 7/157 cut-off events. [2023-08-25 18:45:42,577 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 18:45:42,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 157 events. 7/157 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 167 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-08-25 18:45:42,583 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 159 transitions, 334 flow [2023-08-25 18:45:42,588 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 148 transitions, 308 flow [2023-08-25 18:45:42,592 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 18:45:42,600 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 148 transitions, 308 flow [2023-08-25 18:45:42,625 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 148 transitions, 308 flow [2023-08-25 18:45:42,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 148 transitions, 308 flow [2023-08-25 18:45:42,692 INFO L124 PetriNetUnfolderBase]: 7/148 cut-off events. [2023-08-25 18:45:42,692 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 18:45:42,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 148 events. 7/148 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 166 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2023-08-25 18:45:42,699 INFO L119 LiptonReduction]: Number of co-enabled transitions 2576 [2023-08-25 18:45:46,674 INFO L134 LiptonReduction]: Checked pairs total: 4912 [2023-08-25 18:45:46,674 INFO L136 LiptonReduction]: Total number of compositions: 185 [2023-08-25 18:45:46,687 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 18:45:46,692 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;@4020b134, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 18:45:46,692 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2023-08-25 18:45:46,693 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 18:45:46,693 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 18:45:46,693 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 18:45:46,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:45:46,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 18:45:46,695 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-25 18:45:46,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:45:46,699 INFO L85 PathProgramCache]: Analyzing trace with hash 605, now seen corresponding path program 1 times [2023-08-25 18:45:46,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:45:46,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386553386] [2023-08-25 18:45:46,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:45:46,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:45:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:45:46,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 18:45:46,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:45:46,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386553386] [2023-08-25 18:45:46,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386553386] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 18:45:46,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 18:45:46,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 18:45:46,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718918536] [2023-08-25 18:45:46,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 18:45:46,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 18:45:46,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:45:46,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 18:45:46,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 18:45:46,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 344 [2023-08-25 18:45:46,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 37 transitions, 86 flow. Second operand has 2 states, 2 states have (on average 150.5) internal successors, (301), 2 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:46,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:45:46,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 344 [2023-08-25 18:45:46,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:45:46,875 INFO L124 PetriNetUnfolderBase]: 40/81 cut-off events. [2023-08-25 18:45:46,876 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-08-25 18:45:46,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 81 events. 40/81 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 179 event pairs, 24 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 128. Up to 74 conditions per place. [2023-08-25 18:45:46,877 INFO L140 encePairwiseOnDemand]: 324/344 looper letters, 15 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2023-08-25 18:45:46,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 17 transitions, 76 flow [2023-08-25 18:45:46,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 18:45:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 18:45:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 335 transitions. [2023-08-25 18:45:46,898 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48691860465116277 [2023-08-25 18:45:46,898 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 335 transitions. [2023-08-25 18:45:46,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 335 transitions. [2023-08-25 18:45:46,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:45:46,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 335 transitions. [2023-08-25 18:45:46,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 167.5) internal successors, (335), 2 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:46,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:46,913 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:46,915 INFO L175 Difference]: Start difference. First operand has 40 places, 37 transitions, 86 flow. Second operand 2 states and 335 transitions. [2023-08-25 18:45:46,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 17 transitions, 76 flow [2023-08-25 18:45:46,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 17 transitions, 68 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 18:45:46,919 INFO L231 Difference]: Finished difference. Result has 19 places, 17 transitions, 38 flow [2023-08-25 18:45:46,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=38, PETRI_PLACES=19, PETRI_TRANSITIONS=17} [2023-08-25 18:45:46,924 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -21 predicate places. [2023-08-25 18:45:46,925 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 38 flow [2023-08-25 18:45:46,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 150.5) internal successors, (301), 2 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:46,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:45:46,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-25 18:45:46,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 18:45:46,926 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-25 18:45:46,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:45:46,926 INFO L85 PathProgramCache]: Analyzing trace with hash 18624315, now seen corresponding path program 1 times [2023-08-25 18:45:46,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:45:46,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143515140] [2023-08-25 18:45:46,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:45:46,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:45:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:45:47,006 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 18:45:47,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:45:47,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143515140] [2023-08-25 18:45:47,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143515140] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 18:45:47,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 18:45:47,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 18:45:47,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074220720] [2023-08-25 18:45:47,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 18:45:47,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 18:45:47,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:45:47,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 18:45:47,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 18:45:47,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 344 [2023-08-25 18:45:47,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:47,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:45:47,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 344 [2023-08-25 18:45:47,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:45:47,058 INFO L124 PetriNetUnfolderBase]: 45/82 cut-off events. [2023-08-25 18:45:47,058 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 18:45:47,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 82 events. 45/82 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 163 event pairs, 8 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 169. Up to 77 conditions per place. [2023-08-25 18:45:47,059 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 18 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2023-08-25 18:45:47,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 20 transitions, 85 flow [2023-08-25 18:45:47,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 18:45:47,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 18:45:47,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-08-25 18:45:47,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4312015503875969 [2023-08-25 18:45:47,063 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-08-25 18:45:47,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-08-25 18:45:47,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:45:47,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-08-25 18:45:47,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:47,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:47,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:47,068 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 38 flow. Second operand 3 states and 445 transitions. [2023-08-25 18:45:47,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 20 transitions, 85 flow [2023-08-25 18:45:47,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 20 transitions, 85 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 18:45:47,069 INFO L231 Difference]: Finished difference. Result has 20 places, 17 transitions, 48 flow [2023-08-25 18:45:47,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=20, PETRI_TRANSITIONS=17} [2023-08-25 18:45:47,070 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -20 predicate places. [2023-08-25 18:45:47,070 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 48 flow [2023-08-25 18:45:47,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:47,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:45:47,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 18:45:47,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 18:45:47,071 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-25 18:45:47,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:45:47,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1689284570, now seen corresponding path program 1 times [2023-08-25 18:45:47,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:45:47,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928594976] [2023-08-25 18:45:47,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:45:47,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:45:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:45:47,339 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 18:45:47,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:45:47,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928594976] [2023-08-25 18:45:47,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928594976] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 18:45:47,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 18:45:47,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 18:45:47,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410091090] [2023-08-25 18:45:47,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 18:45:47,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 18:45:47,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:45:47,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 18:45:47,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 18:45:47,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 344 [2023-08-25 18:45:47,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 17 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:47,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:45:47,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 344 [2023-08-25 18:45:47,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:45:47,405 INFO L124 PetriNetUnfolderBase]: 79/143 cut-off events. [2023-08-25 18:45:47,405 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-25 18:45:47,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 143 events. 79/143 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 391 event pairs, 20 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 331. Up to 88 conditions per place. [2023-08-25 18:45:47,410 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 25 selfloop transitions, 3 changer transitions 1/29 dead transitions. [2023-08-25 18:45:47,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 29 transitions, 137 flow [2023-08-25 18:45:47,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 18:45:47,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 18:45:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-08-25 18:45:47,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4253875968992248 [2023-08-25 18:45:47,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-08-25 18:45:47,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-08-25 18:45:47,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:45:47,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-08-25 18:45:47,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:47,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:47,417 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:47,417 INFO L175 Difference]: Start difference. First operand has 20 places, 17 transitions, 48 flow. Second operand 3 states and 439 transitions. [2023-08-25 18:45:47,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 29 transitions, 137 flow [2023-08-25 18:45:47,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 29 transitions, 137 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 18:45:47,419 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 67 flow [2023-08-25 18:45:47,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2023-08-25 18:45:47,420 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -17 predicate places. [2023-08-25 18:45:47,420 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 67 flow [2023-08-25 18:45:47,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:47,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:45:47,421 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 18:45:47,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 18:45:47,421 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-25 18:45:47,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:45:47,422 INFO L85 PathProgramCache]: Analyzing trace with hash 147101233, now seen corresponding path program 1 times [2023-08-25 18:45:47,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:45:47,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848416747] [2023-08-25 18:45:47,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:45:47,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:45:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:45:47,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:45:47,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:45:47,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848416747] [2023-08-25 18:45:47,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848416747] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 18:45:47,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 18:45:47,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 18:45:47,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931225819] [2023-08-25 18:45:47,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 18:45:47,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 18:45:47,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:45:47,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 18:45:47,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 18:45:47,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-25 18:45:47,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 67 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:47,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:45:47,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-25 18:45:47,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:45:47,616 INFO L124 PetriNetUnfolderBase]: 77/141 cut-off events. [2023-08-25 18:45:47,617 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-08-25 18:45:47,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 141 events. 77/141 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 385 event pairs, 9 based on Foata normal form. 2/143 useless extension candidates. Maximal degree in co-relation 373. Up to 49 conditions per place. [2023-08-25 18:45:47,619 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 32 selfloop transitions, 6 changer transitions 5/43 dead transitions. [2023-08-25 18:45:47,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 43 transitions, 221 flow [2023-08-25 18:45:47,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 18:45:47,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 18:45:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 717 transitions. [2023-08-25 18:45:47,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41686046511627906 [2023-08-25 18:45:47,622 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 717 transitions. [2023-08-25 18:45:47,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 717 transitions. [2023-08-25 18:45:47,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:45:47,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 717 transitions. [2023-08-25 18:45:47,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.4) internal successors, (717), 5 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:47,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:47,628 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:47,628 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 67 flow. Second operand 5 states and 717 transitions. [2023-08-25 18:45:47,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 43 transitions, 221 flow [2023-08-25 18:45:47,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 43 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 18:45:47,631 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 88 flow [2023-08-25 18:45:47,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2023-08-25 18:45:47,633 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -13 predicate places. [2023-08-25 18:45:47,633 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 88 flow [2023-08-25 18:45:47,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:47,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:45:47,633 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 18:45:47,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 18:45:47,634 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-25 18:45:47,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:45:47,635 INFO L85 PathProgramCache]: Analyzing trace with hash 494047363, now seen corresponding path program 1 times [2023-08-25 18:45:47,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:45:47,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256661430] [2023-08-25 18:45:47,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:45:47,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:45:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:45:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:45:47,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:45:47,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256661430] [2023-08-25 18:45:47,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256661430] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 18:45:47,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 18:45:47,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 18:45:47,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072215299] [2023-08-25 18:45:47,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 18:45:47,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 18:45:47,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:45:47,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 18:45:47,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 18:45:47,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-25 18:45:47,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:47,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:45:47,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-25 18:45:47,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:45:47,815 INFO L124 PetriNetUnfolderBase]: 67/127 cut-off events. [2023-08-25 18:45:47,815 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-08-25 18:45:47,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 127 events. 67/127 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 343 event pairs, 7 based on Foata normal form. 4/131 useless extension candidates. Maximal degree in co-relation 378. Up to 61 conditions per place. [2023-08-25 18:45:47,819 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 26 selfloop transitions, 4 changer transitions 9/39 dead transitions. [2023-08-25 18:45:47,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 39 transitions, 217 flow [2023-08-25 18:45:47,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 18:45:47,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 18:45:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 713 transitions. [2023-08-25 18:45:47,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4145348837209302 [2023-08-25 18:45:47,825 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 713 transitions. [2023-08-25 18:45:47,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 713 transitions. [2023-08-25 18:45:47,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:45:47,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 713 transitions. [2023-08-25 18:45:47,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.6) internal successors, (713), 5 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:47,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:47,831 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:47,831 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 88 flow. Second operand 5 states and 713 transitions. [2023-08-25 18:45:47,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 39 transitions, 217 flow [2023-08-25 18:45:47,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 39 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 18:45:47,834 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 82 flow [2023-08-25 18:45:47,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2023-08-25 18:45:47,836 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -10 predicate places. [2023-08-25 18:45:47,836 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 82 flow [2023-08-25 18:45:47,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:47,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:45:47,837 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 18:45:47,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 18:45:47,837 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-25 18:45:47,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:45:47,838 INFO L85 PathProgramCache]: Analyzing trace with hash 567858883, now seen corresponding path program 2 times [2023-08-25 18:45:47,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:45:47,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488055711] [2023-08-25 18:45:47,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:45:47,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:45:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:45:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:45:47,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:45:47,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488055711] [2023-08-25 18:45:47,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488055711] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 18:45:47,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122317521] [2023-08-25 18:45:47,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 18:45:47,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:45:47,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 18:45:47,925 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 18:45:47,932 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 18:45:48,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 18:45:48,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 18:45:48,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 18:45:48,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 18:45:48,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:45:48,130 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 18:45:48,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:45:48,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122317521] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 18:45:48,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 18:45:48,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-25 18:45:48,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548463759] [2023-08-25 18:45:48,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 18:45:48,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 18:45:48,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:45:48,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 18:45:48,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 18:45:48,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-25 18:45:48,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:48,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:45:48,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-25 18:45:48,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:45:48,288 INFO L124 PetriNetUnfolderBase]: 78/139 cut-off events. [2023-08-25 18:45:48,288 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-08-25 18:45:48,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 139 events. 78/139 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 337 event pairs, 13 based on Foata normal form. 8/147 useless extension candidates. Maximal degree in co-relation 427. Up to 72 conditions per place. [2023-08-25 18:45:48,290 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 31 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2023-08-25 18:45:48,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 213 flow [2023-08-25 18:45:48,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 18:45:48,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 18:45:48,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2023-08-25 18:45:48,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.413953488372093 [2023-08-25 18:45:48,293 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2023-08-25 18:45:48,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2023-08-25 18:45:48,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:45:48,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2023-08-25 18:45:48,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:48,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:48,298 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:48,298 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 82 flow. Second operand 5 states and 712 transitions. [2023-08-25 18:45:48,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 213 flow [2023-08-25 18:45:48,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 37 transitions, 203 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-25 18:45:48,301 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 109 flow [2023-08-25 18:45:48,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-08-25 18:45:48,303 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-08-25 18:45:48,303 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 109 flow [2023-08-25 18:45:48,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:48,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:45:48,304 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 18:45:48,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-25 18:45:48,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-25 18:45:48,510 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-25 18:45:48,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:45:48,510 INFO L85 PathProgramCache]: Analyzing trace with hash 73483995, now seen corresponding path program 2 times [2023-08-25 18:45:48,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:45:48,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138628417] [2023-08-25 18:45:48,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:45:48,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:45:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:45:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:45:48,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:45:48,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138628417] [2023-08-25 18:45:48,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138628417] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 18:45:48,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372844631] [2023-08-25 18:45:48,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 18:45:48,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:45:48,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 18:45:48,575 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 18:45:48,600 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 18:45:48,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 18:45:48,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 18:45:48,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 18:45:48,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 18:45:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:45:48,711 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 18:45:48,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:45:48,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372844631] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 18:45:48,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 18:45:48,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-25 18:45:48,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695214612] [2023-08-25 18:45:48,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 18:45:48,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 18:45:48,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:45:48,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 18:45:48,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 18:45:48,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-25 18:45:48,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:48,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:45:48,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-25 18:45:48,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:45:48,838 INFO L124 PetriNetUnfolderBase]: 96/169 cut-off events. [2023-08-25 18:45:48,839 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2023-08-25 18:45:48,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 169 events. 96/169 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 432 event pairs, 17 based on Foata normal form. 6/175 useless extension candidates. Maximal degree in co-relation 572. Up to 122 conditions per place. [2023-08-25 18:45:48,840 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 30 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2023-08-25 18:45:48,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 36 transitions, 234 flow [2023-08-25 18:45:48,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 18:45:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 18:45:48,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2023-08-25 18:45:48,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4116279069767442 [2023-08-25 18:45:48,843 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 708 transitions. [2023-08-25 18:45:48,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 708 transitions. [2023-08-25 18:45:48,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:45:48,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 708 transitions. [2023-08-25 18:45:48,845 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.6) internal successors, (708), 5 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:48,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:48,847 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:48,847 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 109 flow. Second operand 5 states and 708 transitions. [2023-08-25 18:45:48,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 36 transitions, 234 flow [2023-08-25 18:45:48,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 36 transitions, 229 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-25 18:45:48,849 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 145 flow [2023-08-25 18:45:48,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-25 18:45:48,850 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-08-25 18:45:48,850 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 145 flow [2023-08-25 18:45:48,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:45:48,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:45:48,851 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 18:45:48,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-25 18:45:49,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-08-25 18:45:49,056 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-25 18:45:49,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:45:49,057 INFO L85 PathProgramCache]: Analyzing trace with hash 335338564, now seen corresponding path program 1 times [2023-08-25 18:45:49,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:45:49,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727439009] [2023-08-25 18:45:49,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:45:49,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:45:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:45:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:45:49,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:45:49,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727439009] [2023-08-25 18:45:49,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727439009] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 18:45:49,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868083078] [2023-08-25 18:45:49,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:45:49,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:45:49,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 18:45:49,463 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 18:45:49,469 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 18:45:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:45:49,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-25 18:45:49,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 18:45:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:45:57,007 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 18:46:03,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:46:03,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868083078] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 18:46:03,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 18:46:03,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-25 18:46:03,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112571257] [2023-08-25 18:46:03,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 18:46:03,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-25 18:46:03,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:46:03,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-25 18:46:03,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=147, Unknown=1, NotChecked=0, Total=210 [2023-08-25 18:46:03,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-25 18:46:03,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 145 flow. Second operand has 15 states, 15 states have (on average 137.73333333333332) internal successors, (2066), 15 states have internal predecessors, (2066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:03,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:46:03,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-25 18:46:03,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:46:05,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:46:08,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:46:10,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:46:13,935 INFO L124 PetriNetUnfolderBase]: 312/560 cut-off events. [2023-08-25 18:46:13,936 INFO L125 PetriNetUnfolderBase]: For 1028/1028 co-relation queries the response was YES. [2023-08-25 18:46:13,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2058 conditions, 560 events. 312/560 cut-off events. For 1028/1028 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2242 event pairs, 21 based on Foata normal form. 7/567 useless extension candidates. Maximal degree in co-relation 2045. Up to 146 conditions per place. [2023-08-25 18:46:13,940 INFO L140 encePairwiseOnDemand]: 338/344 looper letters, 75 selfloop transitions, 25 changer transitions 19/119 dead transitions. [2023-08-25 18:46:13,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 119 transitions, 815 flow [2023-08-25 18:46:13,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-25 18:46:13,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-25 18:46:13,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1867 transitions. [2023-08-25 18:46:13,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4174865831842576 [2023-08-25 18:46:13,945 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1867 transitions. [2023-08-25 18:46:13,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1867 transitions. [2023-08-25 18:46:13,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:46:13,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1867 transitions. [2023-08-25 18:46:13,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 143.6153846153846) internal successors, (1867), 13 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:13,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 344.0) internal successors, (4816), 14 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:13,958 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 344.0) internal successors, (4816), 14 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:13,958 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 145 flow. Second operand 13 states and 1867 transitions. [2023-08-25 18:46:13,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 119 transitions, 815 flow [2023-08-25 18:46:13,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 119 transitions, 800 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-25 18:46:13,963 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 397 flow [2023-08-25 18:46:13,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=397, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-08-25 18:46:13,964 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2023-08-25 18:46:13,964 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 397 flow [2023-08-25 18:46:13,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 137.73333333333332) internal successors, (2066), 15 states have internal predecessors, (2066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:13,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:46:13,965 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 18:46:13,973 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 18:46:14,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:46:14,171 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-25 18:46:14,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:46:14,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1718693540, now seen corresponding path program 2 times [2023-08-25 18:46:14,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:46:14,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745521936] [2023-08-25 18:46:14,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:46:14,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:46:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:46:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:46:14,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:46:14,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745521936] [2023-08-25 18:46:14,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745521936] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 18:46:14,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260004622] [2023-08-25 18:46:14,613 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 18:46:14,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:46:14,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 18:46:14,617 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 18:46:14,621 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 18:46:14,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 18:46:14,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 18:46:14,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-25 18:46:14,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 18:46:18,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:46:18,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 18:46:19,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:46:19,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260004622] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 18:46:19,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 18:46:19,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-25 18:46:19,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295088947] [2023-08-25 18:46:19,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 18:46:19,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-25 18:46:19,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:46:19,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-25 18:46:19,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2023-08-25 18:46:19,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-25 18:46:19,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 397 flow. Second operand has 15 states, 15 states have (on average 137.66666666666666) internal successors, (2065), 15 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:19,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:46:19,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-25 18:46:19,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:46:23,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:46:25,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:46:27,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:46:31,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:46:32,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:46:35,800 INFO L124 PetriNetUnfolderBase]: 439/799 cut-off events. [2023-08-25 18:46:35,800 INFO L125 PetriNetUnfolderBase]: For 3500/3500 co-relation queries the response was YES. [2023-08-25 18:46:35,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3537 conditions, 799 events. 439/799 cut-off events. For 3500/3500 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3628 event pairs, 59 based on Foata normal form. 9/808 useless extension candidates. Maximal degree in co-relation 3516. Up to 451 conditions per place. [2023-08-25 18:46:35,806 INFO L140 encePairwiseOnDemand]: 338/344 looper letters, 85 selfloop transitions, 27 changer transitions 20/132 dead transitions. [2023-08-25 18:46:35,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 132 transitions, 1152 flow [2023-08-25 18:46:35,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-25 18:46:35,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-25 18:46:35,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1860 transitions. [2023-08-25 18:46:35,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4159212880143113 [2023-08-25 18:46:35,812 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1860 transitions. [2023-08-25 18:46:35,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1860 transitions. [2023-08-25 18:46:35,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:46:35,813 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1860 transitions. [2023-08-25 18:46:35,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 143.07692307692307) internal successors, (1860), 13 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 18:46:35,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 344.0) internal successors, (4816), 14 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:35,824 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 344.0) internal successors, (4816), 14 states have internal predecessors, (4816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:35,824 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 397 flow. Second operand 13 states and 1860 transitions. [2023-08-25 18:46:35,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 132 transitions, 1152 flow [2023-08-25 18:46:35,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 132 transitions, 1057 flow, removed 46 selfloop flow, removed 2 redundant places. [2023-08-25 18:46:35,836 INFO L231 Difference]: Finished difference. Result has 72 places, 65 transitions, 598 flow [2023-08-25 18:46:35,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=598, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2023-08-25 18:46:35,837 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 32 predicate places. [2023-08-25 18:46:35,837 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 598 flow [2023-08-25 18:46:35,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 137.66666666666666) internal successors, (2065), 15 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:35,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:46:35,838 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 18:46:35,847 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 18:46:36,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:46:36,043 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-25 18:46:36,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:46:36,044 INFO L85 PathProgramCache]: Analyzing trace with hash 29739985, now seen corresponding path program 3 times [2023-08-25 18:46:36,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:46:36,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011465856] [2023-08-25 18:46:36,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:46:36,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:46:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:46:36,172 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:46:36,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:46:36,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011465856] [2023-08-25 18:46:36,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011465856] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 18:46:36,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844515079] [2023-08-25 18:46:36,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 18:46:36,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:46:36,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 18:46:36,174 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 18:46:36,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-25 18:46:41,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-25 18:46:41,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 18:46:41,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-25 18:46:41,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 18:46:46,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:46:46,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 18:46:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:46:52,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844515079] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 18:46:52,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 18:46:52,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 14 [2023-08-25 18:46:52,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882521018] [2023-08-25 18:46:52,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 18:46:52,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-25 18:46:52,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:46:52,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-25 18:46:52,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=145, Unknown=3, NotChecked=0, Total=210 [2023-08-25 18:46:52,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-25 18:46:52,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 598 flow. Second operand has 15 states, 15 states have (on average 138.4) internal successors, (2076), 15 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:46:52,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:46:52,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-25 18:46:52,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:46:56,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:46:58,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:47:01,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:47:02,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:47:04,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:47:15,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:47:17,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:47:20,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:47:22,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:47:24,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:47:42,750 INFO L124 PetriNetUnfolderBase]: 828/1470 cut-off events. [2023-08-25 18:47:42,751 INFO L125 PetriNetUnfolderBase]: For 10278/10278 co-relation queries the response was YES. [2023-08-25 18:47:42,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7047 conditions, 1470 events. 828/1470 cut-off events. For 10278/10278 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7118 event pairs, 71 based on Foata normal form. 40/1510 useless extension candidates. Maximal degree in co-relation 7017. Up to 392 conditions per place. [2023-08-25 18:47:42,763 INFO L140 encePairwiseOnDemand]: 338/344 looper letters, 124 selfloop transitions, 80 changer transitions 45/249 dead transitions. [2023-08-25 18:47:42,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 249 transitions, 2599 flow [2023-08-25 18:47:42,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-25 18:47:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-25 18:47:42,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3412 transitions. [2023-08-25 18:47:42,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132751937984496 [2023-08-25 18:47:42,775 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3412 transitions. [2023-08-25 18:47:42,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3412 transitions. [2023-08-25 18:47:42,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:47:42,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3412 transitions. [2023-08-25 18:47:42,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 142.16666666666666) internal successors, (3412), 24 states have internal predecessors, (3412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:42,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 344.0) internal successors, (8600), 25 states have internal predecessors, (8600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:42,822 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 344.0) internal successors, (8600), 25 states have internal predecessors, (8600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:42,822 INFO L175 Difference]: Start difference. First operand has 72 places, 65 transitions, 598 flow. Second operand 24 states and 3412 transitions. [2023-08-25 18:47:42,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 249 transitions, 2599 flow [2023-08-25 18:47:42,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 249 transitions, 2409 flow, removed 92 selfloop flow, removed 5 redundant places. [2023-08-25 18:47:42,843 INFO L231 Difference]: Finished difference. Result has 98 places, 125 transitions, 1323 flow [2023-08-25 18:47:42,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1323, PETRI_PLACES=98, PETRI_TRANSITIONS=125} [2023-08-25 18:47:42,844 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 58 predicate places. [2023-08-25 18:47:42,844 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 125 transitions, 1323 flow [2023-08-25 18:47:42,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 138.4) internal successors, (2076), 15 states have internal predecessors, (2076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:47:42,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:47:42,845 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 18:47:42,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-25 18:47:43,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-25 18:47:43,055 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-25 18:47:43,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:47:43,056 INFO L85 PathProgramCache]: Analyzing trace with hash -147232803, now seen corresponding path program 4 times [2023-08-25 18:47:43,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:47:43,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396614124] [2023-08-25 18:47:43,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:47:43,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:47:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:47:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:47:43,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:47:43,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396614124] [2023-08-25 18:47:43,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396614124] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 18:47:43,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385224675] [2023-08-25 18:47:43,164 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-25 18:47:43,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:47:43,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 18:47:43,166 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 18:47:43,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-25 18:47:44,223 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-25 18:47:44,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 18:47:44,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-25 18:47:44,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 18:47:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:47:54,765 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 18:48:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:48:14,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385224675] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 18:48:14,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 18:48:14,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 14 [2023-08-25 18:48:14,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985882414] [2023-08-25 18:48:14,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 18:48:14,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-25 18:48:14,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:48:14,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-25 18:48:14,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=145, Unknown=11, NotChecked=0, Total=210 [2023-08-25 18:48:14,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-25 18:48:14,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 125 transitions, 1323 flow. Second operand has 15 states, 15 states have (on average 138.46666666666667) internal successors, (2077), 15 states have internal predecessors, (2077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:48:14,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:48:14,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-25 18:48:14,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:48:16,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:48:18,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:48:20,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:48:25,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:48:27,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:48:29,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:48:31,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:48:45,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:48:47,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:48:48,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:48:50,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:18,391 WARN L234 SmtUtils]: Spent 1.29m on a formula simplification. DAG size of input: 58 DAG size of output: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 18:50:20,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:22,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:24,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:26,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:39,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:41,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:43,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:45,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:47,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:49,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:51,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:53,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:55,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:58,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:50:59,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:01,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:03,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:05,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:08,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:10,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:12,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:14,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:16,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:19,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:21,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:22,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:24,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:26,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:28,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:39,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:41,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:45,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:48,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:50,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:52,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:55,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:57,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:51:59,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:03,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:05,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:07,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:09,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:11,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:13,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:15,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:17,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:19,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:24,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:26,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:36,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:38,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:46,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:48,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:50,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:52,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:56,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:52:58,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:53:00,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:53:02,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:53:04,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:53:06,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:53:08,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:53:11,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:53:13,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:53:15,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:53:17,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:53:19,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:53:31,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:53:35,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:53:43,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:53:45,398 INFO L124 PetriNetUnfolderBase]: 1088/2015 cut-off events. [2023-08-25 18:53:45,398 INFO L125 PetriNetUnfolderBase]: For 17472/17472 co-relation queries the response was YES. [2023-08-25 18:53:45,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10355 conditions, 2015 events. 1088/2015 cut-off events. For 17472/17472 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 10426 event pairs, 107 based on Foata normal form. 18/2033 useless extension candidates. Maximal degree in co-relation 10317. Up to 802 conditions per place. [2023-08-25 18:53:45,413 INFO L140 encePairwiseOnDemand]: 336/344 looper letters, 180 selfloop transitions, 161 changer transitions 38/379 dead transitions. [2023-08-25 18:53:45,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 379 transitions, 4350 flow [2023-08-25 18:53:45,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-25 18:53:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-25 18:53:45,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3695 transitions. [2023-08-25 18:53:45,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41312611806797855 [2023-08-25 18:53:45,423 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 3695 transitions. [2023-08-25 18:53:45,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 3695 transitions. [2023-08-25 18:53:45,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 18:53:45,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 3695 transitions. [2023-08-25 18:53:45,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 142.1153846153846) internal successors, (3695), 26 states have internal predecessors, (3695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:53:45,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 344.0) internal successors, (9288), 27 states have internal predecessors, (9288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:53:45,443 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 344.0) internal successors, (9288), 27 states have internal predecessors, (9288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:53:45,443 INFO L175 Difference]: Start difference. First operand has 98 places, 125 transitions, 1323 flow. Second operand 26 states and 3695 transitions. [2023-08-25 18:53:45,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 379 transitions, 4350 flow [2023-08-25 18:53:45,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 379 transitions, 3761 flow, removed 264 selfloop flow, removed 10 redundant places. [2023-08-25 18:53:45,515 INFO L231 Difference]: Finished difference. Result has 124 places, 241 transitions, 2852 flow [2023-08-25 18:53:45,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2852, PETRI_PLACES=124, PETRI_TRANSITIONS=241} [2023-08-25 18:53:45,516 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 84 predicate places. [2023-08-25 18:53:45,516 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 241 transitions, 2852 flow [2023-08-25 18:53:45,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 138.46666666666667) internal successors, (2077), 15 states have internal predecessors, (2077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:53:45,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 18:53:45,517 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 18:53:45,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-25 18:53:45,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:53:45,725 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2023-08-25 18:53:45,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 18:53:45,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2097007233, now seen corresponding path program 5 times [2023-08-25 18:53:45,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 18:53:45,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818361120] [2023-08-25 18:53:45,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 18:53:45,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 18:53:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 18:53:45,842 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:53:45,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 18:53:45,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818361120] [2023-08-25 18:53:45,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818361120] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 18:53:45,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18676823] [2023-08-25 18:53:45,843 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-25 18:53:45,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 18:53:45,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 18:53:45,844 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 18:53:45,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-25 18:54:56,103 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-25 18:54:56,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 18:54:56,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-25 18:54:56,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 18:55:23,654 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_~x1~0 2))) (let ((.cse1 (mod (* (div (* (- 1) c_~x2~0) 2) 4294967295) 4294967296)) (.cse3 (+ (mod .cse0 4294967296) 1)) (.cse2 (mod c_~x1~0 4294967296))) (and (= (mod .cse0 2) 0) (= (mod c_~x2~0 2) 0) (= .cse1 (mod (div c_~x1~0 4) 4294967296)) (<= (+ .cse1 1) .cse2) (= (mod c_~x1~0 2) 0) (<= .cse3 (mod c_~x2~0 4294967296)) (<= .cse3 .cse2)))) is different from false [2023-08-25 18:56:36,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:56:36,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 18:56:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 18:56:55,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18676823] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 18:56:55,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 18:56:55,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2023-08-25 18:56:55,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055537006] [2023-08-25 18:56:55,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 18:56:55,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-25 18:56:55,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 18:56:55,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-25 18:56:55,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=159, Unknown=14, NotChecked=28, Total=272 [2023-08-25 18:56:55,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 344 [2023-08-25 18:56:55,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 241 transitions, 2852 flow. Second operand has 17 states, 17 states have (on average 138.35294117647058) internal successors, (2352), 17 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 18:56:55,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 18:56:55,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 344 [2023-08-25 18:56:55,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 18:56:57,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:57:00,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:57:02,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:57:04,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:57:06,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:57:41,250 WARN L234 SmtUtils]: Spent 29.82s on a formula simplification. DAG size of input: 37 DAG size of output: 35 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 18:57:45,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:57:47,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:57:51,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:57:54,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:57:57,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:57:59,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:01,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:03,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:05,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:07,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:09,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:11,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:13,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:15,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:17,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:30,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:32,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:34,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:36,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:39,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:41,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:43,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:45,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:47,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:49,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:51,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:53,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:55,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:57,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:58:59,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:59:01,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:59:04,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:59:05,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:59:07,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:59:10,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:59:12,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:59:14,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:59:16,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 18:59:18,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:59:20,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:59:23,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:59:26,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:59:28,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:59:30,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:59:32,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:59:34,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:59:50,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:59:52,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 18:59:54,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-25 19:00:13,207 WARN L234 SmtUtils]: Spent 6.34s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 19:00:15,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-25 19:00:17,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 [] Received shutdown request... [2023-08-25 19:00:18,092 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 19:00:18,094 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 19:00:19,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-25 19:00:19,293 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 19:00:19,299 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONASSERT (32 of 33 remaining) [2023-08-25 19:00:19,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-25 19:00:19,299 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-25 19:00:19,300 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 19:00:19,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2023-08-25 19:00:19,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2023-08-25 19:00:19,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2023-08-25 19:00:19,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2023-08-25 19:00:19,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2023-08-25 19:00:19,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (26 of 33 remaining) [2023-08-25 19:00:19,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2023-08-25 19:00:19,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2023-08-25 19:00:19,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2023-08-25 19:00:19,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2023-08-25 19:00:19,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2023-08-25 19:00:19,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2023-08-25 19:00:19,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2023-08-25 19:00:19,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2023-08-25 19:00:19,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2023-08-25 19:00:19,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2023-08-25 19:00:19,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (15 of 33 remaining) [2023-08-25 19:00:19,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (14 of 33 remaining) [2023-08-25 19:00:19,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (13 of 33 remaining) [2023-08-25 19:00:19,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (12 of 33 remaining) [2023-08-25 19:00:19,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 33 remaining) [2023-08-25 19:00:19,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 33 remaining) [2023-08-25 19:00:19,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2023-08-25 19:00:19,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2023-08-25 19:00:19,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2023-08-25 19:00:19,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2023-08-25 19:00:19,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (5 of 33 remaining) [2023-08-25 19:00:19,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2023-08-25 19:00:19,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2023-08-25 19:00:19,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2023-08-25 19:00:19,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2023-08-25 19:00:19,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2023-08-25 19:00:19,304 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1] [2023-08-25 19:00:19,307 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 19:00:19,308 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 19:00:19,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 07:00:19 BasicIcfg [2023-08-25 19:00:19,310 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 19:00:19,310 INFO L158 Benchmark]: Toolchain (without parser) took 877641.34ms. Allocated memory was 360.7MB in the beginning and 522.2MB in the end (delta: 161.5MB). Free memory was 336.5MB in the beginning and 257.7MB in the end (delta: 78.7MB). Peak memory consumption was 241.9MB. Max. memory is 16.0GB. [2023-08-25 19:00:19,310 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 360.7MB. Free memory is still 336.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 19:00:19,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.20ms. Allocated memory is still 360.7MB. Free memory was 336.5MB in the beginning and 325.8MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-25 19:00:19,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.72ms. Allocated memory is still 360.7MB. Free memory was 325.6MB in the beginning and 323.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 19:00:19,311 INFO L158 Benchmark]: Boogie Preprocessor took 36.35ms. Allocated memory is still 360.7MB. Free memory was 323.6MB in the beginning and 322.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 19:00:19,311 INFO L158 Benchmark]: RCFGBuilder took 433.17ms. Allocated memory is still 360.7MB. Free memory was 322.0MB in the beginning and 305.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-08-25 19:00:19,311 INFO L158 Benchmark]: TraceAbstraction took 876936.07ms. Allocated memory was 360.7MB in the beginning and 522.2MB in the end (delta: 161.5MB). Free memory was 305.3MB in the beginning and 257.7MB in the end (delta: 47.6MB). Peak memory consumption was 210.5MB. Max. memory is 16.0GB. [2023-08-25 19:00:19,312 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.16ms. Allocated memory is still 360.7MB. Free memory is still 336.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 192.20ms. Allocated memory is still 360.7MB. Free memory was 336.5MB in the beginning and 325.8MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 38.72ms. Allocated memory is still 360.7MB. Free memory was 325.6MB in the beginning and 323.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 36.35ms. Allocated memory is still 360.7MB. Free memory was 323.6MB in the beginning and 322.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 433.17ms. Allocated memory is still 360.7MB. Free memory was 322.0MB in the beginning and 305.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 876936.07ms. Allocated memory was 360.7MB in the beginning and 522.2MB in the end (delta: 161.5MB). Free memory was 305.3MB in the beginning and 257.7MB in the end (delta: 47.6MB). Peak memory consumption was 210.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 148 PlacesBefore, 40 PlacesAfterwards, 148 TransitionsBefore, 37 TransitionsAfterwards, 2576 CoEnabledTransitionPairs, 8 FixpointIterations, 92 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 12 TrivialYvCompositions, 7 ConcurrentYvCompositions, 3 ChoiceCompositions, 185 TotalNumberOfCompositions, 4912 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3606, independent: 3487, independent conditional: 0, independent unconditional: 3487, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1556, independent: 1531, independent conditional: 0, independent unconditional: 1531, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3606, independent: 1956, independent conditional: 0, independent unconditional: 1956, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 1556, unknown conditional: 0, unknown unconditional: 1556] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 38]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 39]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 46]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 67]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 199 locations, 33 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 876.8s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 612.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 133 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 342.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 492 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 340.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 97 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2375 IncrementalHoareTripleChecker+Invalid, 2698 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 0 mSDtfsCounter, 2375 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 180 SyntacticMatches, 16 SemanticMatches, 126 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 358.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2852occurred in iteration=11, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 77.1s SatisfiabilityAnalysisTime, 180.9s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 385 ConstructedInterpolants, 0 QuantifiedInterpolants, 11887 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1164 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 26 InterpolantComputations, 5 PerfectInterpolantSequences, 21/112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown