/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 21:16:38,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 21:16:38,925 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-25 21:16:38,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 21:16:38,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 21:16:38,952 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 21:16:38,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 21:16:38,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 21:16:38,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 21:16:38,956 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 21:16:38,956 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 21:16:38,957 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 21:16:38,957 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 21:16:38,958 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 21:16:38,958 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 21:16:38,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 21:16:38,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 21:16:38,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 21:16:38,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 21:16:38,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 21:16:38,958 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 21:16:38,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 21:16:38,959 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 21:16:38,960 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 21:16:38,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 21:16:38,960 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 21:16:38,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 21:16:38,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 21:16:38,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 21:16:38,961 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 21:16:38,961 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 21:16:38,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 21:16:38,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 21:16:38,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 21:16:38,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 21:16:38,962 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 21:16:39,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 21:16:39,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 21:16:39,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 21:16:39,221 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 21:16:39,221 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 21:16:39,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2023-08-25 21:16:40,244 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 21:16:40,405 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 21:16:40,405 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-array-sum.wvr.c [2023-08-25 21:16:40,410 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4870869d6/a88b4033d8034d10bea731c9add0d0db/FLAG6e974675f [2023-08-25 21:16:40,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4870869d6/a88b4033d8034d10bea731c9add0d0db [2023-08-25 21:16:40,420 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 21:16:40,422 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 21:16:40,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 21:16:40,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 21:16:40,426 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 21:16:40,427 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 09:16:40" (1/1) ... [2023-08-25 21:16:40,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6640e1f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:40, skipping insertion in model container [2023-08-25 21:16:40,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 09:16:40" (1/1) ... [2023-08-25 21:16:40,442 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 21:16:40,547 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 21:16:40,553 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 21:16:40,574 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 21:16:40,579 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 21:16:40,579 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 21:16:40,583 INFO L206 MainTranslator]: Completed translation [2023-08-25 21:16:40,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:40 WrapperNode [2023-08-25 21:16:40,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 21:16:40,584 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 21:16:40,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 21:16:40,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 21:16:40,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:40" (1/1) ... [2023-08-25 21:16:40,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:40" (1/1) ... [2023-08-25 21:16:40,615 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 179 [2023-08-25 21:16:40,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 21:16:40,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 21:16:40,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 21:16:40,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 21:16:40,629 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:40" (1/1) ... [2023-08-25 21:16:40,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:40" (1/1) ... [2023-08-25 21:16:40,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:40" (1/1) ... [2023-08-25 21:16:40,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:40" (1/1) ... [2023-08-25 21:16:40,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:40" (1/1) ... [2023-08-25 21:16:40,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:40" (1/1) ... [2023-08-25 21:16:40,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:40" (1/1) ... [2023-08-25 21:16:40,672 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:40" (1/1) ... [2023-08-25 21:16:40,674 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 21:16:40,674 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 21:16:40,675 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 21:16:40,675 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 21:16:40,675 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:40" (1/1) ... [2023-08-25 21:16:40,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 21:16:40,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:16:40,702 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-25 21:16:40,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-25 21:16:40,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 21:16:40,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 21:16:40,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 21:16:40,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 21:16:40,782 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 21:16:40,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 21:16:40,782 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 21:16:40,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 21:16:40,782 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-25 21:16:40,782 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-25 21:16:40,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 21:16:40,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-25 21:16:40,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-25 21:16:40,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-25 21:16:40,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 21:16:40,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 21:16:40,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 21:16:40,784 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 21:16:40,874 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 21:16:40,875 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 21:16:41,295 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 21:16:41,359 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 21:16:41,359 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-08-25 21:16:41,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 09:16:41 BoogieIcfgContainer [2023-08-25 21:16:41,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 21:16:41,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 21:16:41,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 21:16:41,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 21:16:41,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 09:16:40" (1/3) ... [2023-08-25 21:16:41,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33145919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 09:16:41, skipping insertion in model container [2023-08-25 21:16:41,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:40" (2/3) ... [2023-08-25 21:16:41,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33145919 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 09:16:41, skipping insertion in model container [2023-08-25 21:16:41,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 09:16:41" (3/3) ... [2023-08-25 21:16:41,383 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2023-08-25 21:16:41,394 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 21:16:41,395 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2023-08-25 21:16:41,395 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 21:16:41,465 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-25 21:16:41,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 274 places, 280 transitions, 584 flow [2023-08-25 21:16:41,554 INFO L124 PetriNetUnfolderBase]: 16/277 cut-off events. [2023-08-25 21:16:41,555 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-25 21:16:41,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 277 events. 16/277 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 378 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 201. Up to 2 conditions per place. [2023-08-25 21:16:41,563 INFO L82 GeneralOperation]: Start removeDead. Operand has 274 places, 280 transitions, 584 flow [2023-08-25 21:16:41,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 260 places, 266 transitions, 550 flow [2023-08-25 21:16:41,574 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 21:16:41,586 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 260 places, 266 transitions, 550 flow [2023-08-25 21:16:41,591 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 260 places, 266 transitions, 550 flow [2023-08-25 21:16:41,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 260 places, 266 transitions, 550 flow [2023-08-25 21:16:41,647 INFO L124 PetriNetUnfolderBase]: 16/266 cut-off events. [2023-08-25 21:16:41,647 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-25 21:16:41,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 266 events. 16/266 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 376 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 201. Up to 2 conditions per place. [2023-08-25 21:16:41,654 INFO L119 LiptonReduction]: Number of co-enabled transitions 7186 [2023-08-25 21:16:47,182 INFO L134 LiptonReduction]: Checked pairs total: 43304 [2023-08-25 21:16:47,183 INFO L136 LiptonReduction]: Total number of compositions: 251 [2023-08-25 21:16:47,192 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 21:16:47,196 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;@7524e1d0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 21:16:47,196 INFO L358 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2023-08-25 21:16:47,197 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 21:16:47,197 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 21:16:47,197 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 21:16:47,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:16:47,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 21:16:47,197 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 21:16:47,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:16:47,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1079, now seen corresponding path program 1 times [2023-08-25 21:16:47,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:16:47,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76605361] [2023-08-25 21:16:47,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:47,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:16:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:16:47,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:16:47,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76605361] [2023-08-25 21:16:47,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76605361] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:16:47,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:16:47,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 21:16:47,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016913] [2023-08-25 21:16:47,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:16:47,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 21:16:47,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:16:47,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 21:16:47,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 21:16:47,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 531 [2023-08-25 21:16:47,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 196 flow. Second operand has 2 states, 2 states have (on average 249.5) internal successors, (499), 2 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:47,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:16:47,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 531 [2023-08-25 21:16:47,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:16:47,457 INFO L124 PetriNetUnfolderBase]: 759/1840 cut-off events. [2023-08-25 21:16:47,457 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-08-25 21:16:47,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2919 conditions, 1840 events. 759/1840 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 13308 event pairs, 379 based on Foata normal form. 294/1687 useless extension candidates. Maximal degree in co-relation 2438. Up to 1002 conditions per place. [2023-08-25 21:16:47,468 INFO L140 encePairwiseOnDemand]: 506/531 looper letters, 28 selfloop transitions, 0 changer transitions 0/64 dead transitions. [2023-08-25 21:16:47,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 202 flow [2023-08-25 21:16:47,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 21:16:47,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 21:16:47,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 551 transitions. [2023-08-25 21:16:47,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188323917137476 [2023-08-25 21:16:47,482 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 551 transitions. [2023-08-25 21:16:47,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 551 transitions. [2023-08-25 21:16:47,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:16:47,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 551 transitions. [2023-08-25 21:16:47,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 275.5) internal successors, (551), 2 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:47,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 531.0) internal successors, (1593), 3 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:47,493 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 531.0) internal successors, (1593), 3 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:47,494 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 196 flow. Second operand 2 states and 551 transitions. [2023-08-25 21:16:47,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 202 flow [2023-08-25 21:16:47,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 190 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-25 21:16:47,498 INFO L231 Difference]: Finished difference. Result has 63 places, 64 transitions, 134 flow [2023-08-25 21:16:47,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=134, PETRI_PLACES=63, PETRI_TRANSITIONS=64} [2023-08-25 21:16:47,501 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -27 predicate places. [2023-08-25 21:16:47,501 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 64 transitions, 134 flow [2023-08-25 21:16:47,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 249.5) internal successors, (499), 2 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:47,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:16:47,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:16:47,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 21:16:47,502 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 21:16:47,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:16:47,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1019390562, now seen corresponding path program 1 times [2023-08-25 21:16:47,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:16:47,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818423995] [2023-08-25 21:16:47,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:47,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:16:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:47,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:16:47,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:16:47,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818423995] [2023-08-25 21:16:47,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818423995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:16:47,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:16:47,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:16:47,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722097093] [2023-08-25 21:16:47,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:16:47,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:16:47,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:16:47,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:16:47,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:16:47,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 531 [2023-08-25 21:16:47,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 64 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:47,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:16:47,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 531 [2023-08-25 21:16:47,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:16:47,767 INFO L124 PetriNetUnfolderBase]: 1447/2666 cut-off events. [2023-08-25 21:16:47,768 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-08-25 21:16:47,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4753 conditions, 2666 events. 1447/2666 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15806 event pairs, 1091 based on Foata normal form. 0/2102 useless extension candidates. Maximal degree in co-relation 4750. Up to 2041 conditions per place. [2023-08-25 21:16:47,781 INFO L140 encePairwiseOnDemand]: 527/531 looper letters, 32 selfloop transitions, 1 changer transitions 0/61 dead transitions. [2023-08-25 21:16:47,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 61 transitions, 194 flow [2023-08-25 21:16:47,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:16:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:16:47,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2023-08-25 21:16:47,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519774011299435 [2023-08-25 21:16:47,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 720 transitions. [2023-08-25 21:16:47,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 720 transitions. [2023-08-25 21:16:47,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:16:47,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 720 transitions. [2023-08-25 21:16:47,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:47,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 531.0) internal successors, (2124), 4 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:47,791 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 531.0) internal successors, (2124), 4 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:47,791 INFO L175 Difference]: Start difference. First operand has 63 places, 64 transitions, 134 flow. Second operand 3 states and 720 transitions. [2023-08-25 21:16:47,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 61 transitions, 194 flow [2023-08-25 21:16:47,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 21:16:47,793 INFO L231 Difference]: Finished difference. Result has 62 places, 61 transitions, 130 flow [2023-08-25 21:16:47,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=62, PETRI_TRANSITIONS=61} [2023-08-25 21:16:47,795 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -28 predicate places. [2023-08-25 21:16:47,795 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 61 transitions, 130 flow [2023-08-25 21:16:47,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:47,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:16:47,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:16:47,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 21:16:47,801 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 21:16:47,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:16:47,802 INFO L85 PathProgramCache]: Analyzing trace with hash 382001754, now seen corresponding path program 1 times [2023-08-25 21:16:47,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:16:47,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505188749] [2023-08-25 21:16:47,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:47,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:16:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:16:47,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:16:47,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505188749] [2023-08-25 21:16:47,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505188749] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:16:47,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:16:47,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:16:47,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117258135] [2023-08-25 21:16:47,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:16:47,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:16:47,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:16:47,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:16:47,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:16:47,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 531 [2023-08-25 21:16:47,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 61 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:47,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:16:47,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 531 [2023-08-25 21:16:47,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:16:48,111 INFO L124 PetriNetUnfolderBase]: 1107/2121 cut-off events. [2023-08-25 21:16:48,111 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-08-25 21:16:48,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3642 conditions, 2121 events. 1107/2121 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13129 event pairs, 174 based on Foata normal form. 0/1762 useless extension candidates. Maximal degree in co-relation 3638. Up to 1227 conditions per place. [2023-08-25 21:16:48,121 INFO L140 encePairwiseOnDemand]: 528/531 looper letters, 47 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2023-08-25 21:16:48,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 80 transitions, 271 flow [2023-08-25 21:16:48,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:16:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:16:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 779 transitions. [2023-08-25 21:16:48,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48901443816698054 [2023-08-25 21:16:48,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 779 transitions. [2023-08-25 21:16:48,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 779 transitions. [2023-08-25 21:16:48,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:16:48,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 779 transitions. [2023-08-25 21:16:48,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 259.6666666666667) internal successors, (779), 3 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:48,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 531.0) internal successors, (2124), 4 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:48,128 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 531.0) internal successors, (2124), 4 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:48,128 INFO L175 Difference]: Start difference. First operand has 62 places, 61 transitions, 130 flow. Second operand 3 states and 779 transitions. [2023-08-25 21:16:48,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 80 transitions, 271 flow [2023-08-25 21:16:48,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 80 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:16:48,130 INFO L231 Difference]: Finished difference. Result has 63 places, 62 transitions, 141 flow [2023-08-25 21:16:48,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=63, PETRI_TRANSITIONS=62} [2023-08-25 21:16:48,130 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -27 predicate places. [2023-08-25 21:16:48,130 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 62 transitions, 141 flow [2023-08-25 21:16:48,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:48,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:16:48,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:16:48,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 21:16:48,131 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 21:16:48,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:16:48,132 INFO L85 PathProgramCache]: Analyzing trace with hash 806442394, now seen corresponding path program 1 times [2023-08-25 21:16:48,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:16:48,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750763880] [2023-08-25 21:16:48,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:48,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:16:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:48,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:16:48,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:16:48,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750763880] [2023-08-25 21:16:48,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750763880] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:16:48,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:16:48,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:16:48,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276005934] [2023-08-25 21:16:48,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:16:48,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:16:48,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:16:48,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:16:48,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:16:48,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 531 [2023-08-25 21:16:48,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 62 transitions, 141 flow. Second operand has 6 states, 6 states have (on average 209.33333333333334) internal successors, (1256), 6 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:48,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:16:48,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 531 [2023-08-25 21:16:48,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:16:49,506 INFO L124 PetriNetUnfolderBase]: 8690/11706 cut-off events. [2023-08-25 21:16:49,506 INFO L125 PetriNetUnfolderBase]: For 1261/1271 co-relation queries the response was YES. [2023-08-25 21:16:49,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24382 conditions, 11706 events. 8690/11706 cut-off events. For 1261/1271 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 65957 event pairs, 2134 based on Foata normal form. 0/9625 useless extension candidates. Maximal degree in co-relation 24378. Up to 6148 conditions per place. [2023-08-25 21:16:49,560 INFO L140 encePairwiseOnDemand]: 524/531 looper letters, 132 selfloop transitions, 13 changer transitions 0/155 dead transitions. [2023-08-25 21:16:49,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 155 transitions, 660 flow [2023-08-25 21:16:49,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:16:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:16:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1378 transitions. [2023-08-25 21:16:49,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4325172630257376 [2023-08-25 21:16:49,563 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1378 transitions. [2023-08-25 21:16:49,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1378 transitions. [2023-08-25 21:16:49,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:16:49,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1378 transitions. [2023-08-25 21:16:49,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 229.66666666666666) internal successors, (1378), 6 states have internal predecessors, (1378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:49,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:49,571 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:49,571 INFO L175 Difference]: Start difference. First operand has 63 places, 62 transitions, 141 flow. Second operand 6 states and 1378 transitions. [2023-08-25 21:16:49,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 155 transitions, 660 flow [2023-08-25 21:16:49,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 155 transitions, 660 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 21:16:49,574 INFO L231 Difference]: Finished difference. Result has 73 places, 74 transitions, 251 flow [2023-08-25 21:16:49,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=251, PETRI_PLACES=73, PETRI_TRANSITIONS=74} [2023-08-25 21:16:49,576 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -17 predicate places. [2023-08-25 21:16:49,576 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 74 transitions, 251 flow [2023-08-25 21:16:49,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 209.33333333333334) internal successors, (1256), 6 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:49,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:16:49,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:16:49,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 21:16:49,577 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 21:16:49,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:16:49,577 INFO L85 PathProgramCache]: Analyzing trace with hash 302131646, now seen corresponding path program 1 times [2023-08-25 21:16:49,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:16:49,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272292116] [2023-08-25 21:16:49,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:49,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:16:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:16:49,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:16:49,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272292116] [2023-08-25 21:16:49,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272292116] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:16:49,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:16:49,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 21:16:49,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319571262] [2023-08-25 21:16:49,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:16:49,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 21:16:49,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:16:49,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 21:16:49,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 21:16:49,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 531 [2023-08-25 21:16:49,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 74 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 193.6) internal successors, (968), 5 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:49,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:16:49,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 531 [2023-08-25 21:16:49,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:16:50,506 INFO L124 PetriNetUnfolderBase]: 5200/8740 cut-off events. [2023-08-25 21:16:50,506 INFO L125 PetriNetUnfolderBase]: For 6028/6367 co-relation queries the response was YES. [2023-08-25 21:16:50,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20003 conditions, 8740 events. 5200/8740 cut-off events. For 6028/6367 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 62809 event pairs, 2362 based on Foata normal form. 4/7388 useless extension candidates. Maximal degree in co-relation 19994. Up to 5426 conditions per place. [2023-08-25 21:16:50,558 INFO L140 encePairwiseOnDemand]: 523/531 looper letters, 94 selfloop transitions, 10 changer transitions 0/133 dead transitions. [2023-08-25 21:16:50,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 133 transitions, 707 flow [2023-08-25 21:16:50,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:16:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:16:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1223 transitions. [2023-08-25 21:16:50,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38386691776522286 [2023-08-25 21:16:50,561 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1223 transitions. [2023-08-25 21:16:50,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1223 transitions. [2023-08-25 21:16:50,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:16:50,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1223 transitions. [2023-08-25 21:16:50,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 203.83333333333334) internal successors, (1223), 6 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:50,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:50,569 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:50,569 INFO L175 Difference]: Start difference. First operand has 73 places, 74 transitions, 251 flow. Second operand 6 states and 1223 transitions. [2023-08-25 21:16:50,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 133 transitions, 707 flow [2023-08-25 21:16:50,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 133 transitions, 707 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 21:16:50,583 INFO L231 Difference]: Finished difference. Result has 82 places, 82 transitions, 319 flow [2023-08-25 21:16:50,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=319, PETRI_PLACES=82, PETRI_TRANSITIONS=82} [2023-08-25 21:16:50,583 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, -8 predicate places. [2023-08-25 21:16:50,583 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 82 transitions, 319 flow [2023-08-25 21:16:50,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 193.6) internal successors, (968), 5 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:50,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:16:50,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:16:50,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 21:16:50,584 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 21:16:50,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:16:50,585 INFO L85 PathProgramCache]: Analyzing trace with hash 796196054, now seen corresponding path program 1 times [2023-08-25 21:16:50,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:16:50,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561531302] [2023-08-25 21:16:50,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:50,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:16:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 21:16:50,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:16:50,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561531302] [2023-08-25 21:16:50,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561531302] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:16:50,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:16:50,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:16:50,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860160337] [2023-08-25 21:16:50,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:16:50,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:16:50,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:16:50,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:16:50,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:16:50,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 531 [2023-08-25 21:16:50,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 82 transitions, 319 flow. Second operand has 6 states, 6 states have (on average 206.5) internal successors, (1239), 6 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:50,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:16:50,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 531 [2023-08-25 21:16:50,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:16:52,576 INFO L124 PetriNetUnfolderBase]: 14534/19791 cut-off events. [2023-08-25 21:16:52,577 INFO L125 PetriNetUnfolderBase]: For 11583/11709 co-relation queries the response was YES. [2023-08-25 21:16:52,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49244 conditions, 19791 events. 14534/19791 cut-off events. For 11583/11709 co-relation queries the response was YES. Maximal size of possible extension queue 947. Compared 120379 event pairs, 5767 based on Foata normal form. 0/16947 useless extension candidates. Maximal degree in co-relation 49230. Up to 15604 conditions per place. [2023-08-25 21:16:52,718 INFO L140 encePairwiseOnDemand]: 524/531 looper letters, 157 selfloop transitions, 25 changer transitions 0/190 dead transitions. [2023-08-25 21:16:52,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 190 transitions, 1139 flow [2023-08-25 21:16:52,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:16:52,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:16:52,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1353 transitions. [2023-08-25 21:16:52,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246704331450094 [2023-08-25 21:16:52,721 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1353 transitions. [2023-08-25 21:16:52,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1353 transitions. [2023-08-25 21:16:52,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:16:52,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1353 transitions. [2023-08-25 21:16:52,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 225.5) internal successors, (1353), 6 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:52,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:52,727 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:52,728 INFO L175 Difference]: Start difference. First operand has 82 places, 82 transitions, 319 flow. Second operand 6 states and 1353 transitions. [2023-08-25 21:16:52,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 190 transitions, 1139 flow [2023-08-25 21:16:52,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 190 transitions, 1137 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-25 21:16:52,775 INFO L231 Difference]: Finished difference. Result has 91 places, 106 transitions, 575 flow [2023-08-25 21:16:52,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=575, PETRI_PLACES=91, PETRI_TRANSITIONS=106} [2023-08-25 21:16:52,777 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 1 predicate places. [2023-08-25 21:16:52,779 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 106 transitions, 575 flow [2023-08-25 21:16:52,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.5) internal successors, (1239), 6 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:52,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:16:52,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:16:52,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 21:16:52,781 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 21:16:52,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:16:52,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1016168326, now seen corresponding path program 1 times [2023-08-25 21:16:52,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:16:52,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963291760] [2023-08-25 21:16:52,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:52,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:16:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:16:52,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:16:52,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963291760] [2023-08-25 21:16:52,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963291760] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:16:52,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:16:52,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 21:16:52,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403789052] [2023-08-25 21:16:52,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:16:52,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 21:16:52,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:16:52,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 21:16:52,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 21:16:52,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 531 [2023-08-25 21:16:52,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 106 transitions, 575 flow. Second operand has 5 states, 5 states have (on average 200.2) internal successors, (1001), 5 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:52,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:16:52,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 531 [2023-08-25 21:16:52,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:16:53,560 INFO L124 PetriNetUnfolderBase]: 3470/6490 cut-off events. [2023-08-25 21:16:53,561 INFO L125 PetriNetUnfolderBase]: For 6727/7212 co-relation queries the response was YES. [2023-08-25 21:16:53,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16077 conditions, 6490 events. 3470/6490 cut-off events. For 6727/7212 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 49145 event pairs, 1331 based on Foata normal form. 96/5547 useless extension candidates. Maximal degree in co-relation 16058. Up to 4145 conditions per place. [2023-08-25 21:16:53,599 INFO L140 encePairwiseOnDemand]: 523/531 looper letters, 87 selfloop transitions, 10 changer transitions 0/136 dead transitions. [2023-08-25 21:16:53,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 136 transitions, 849 flow [2023-08-25 21:16:53,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:16:53,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:16:53,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1255 transitions. [2023-08-25 21:16:53,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39391086001255493 [2023-08-25 21:16:53,602 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1255 transitions. [2023-08-25 21:16:53,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1255 transitions. [2023-08-25 21:16:53,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:16:53,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1255 transitions. [2023-08-25 21:16:53,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 209.16666666666666) internal successors, (1255), 6 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:53,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:53,607 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:53,607 INFO L175 Difference]: Start difference. First operand has 91 places, 106 transitions, 575 flow. Second operand 6 states and 1255 transitions. [2023-08-25 21:16:53,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 136 transitions, 849 flow [2023-08-25 21:16:53,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 136 transitions, 809 flow, removed 20 selfloop flow, removed 0 redundant places. [2023-08-25 21:16:53,619 INFO L231 Difference]: Finished difference. Result has 98 places, 108 transitions, 580 flow [2023-08-25 21:16:53,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=580, PETRI_PLACES=98, PETRI_TRANSITIONS=108} [2023-08-25 21:16:53,619 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 8 predicate places. [2023-08-25 21:16:53,619 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 108 transitions, 580 flow [2023-08-25 21:16:53,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 200.2) internal successors, (1001), 5 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:53,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:16:53,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:16:53,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 21:16:53,620 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 21:16:53,620 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:16:53,620 INFO L85 PathProgramCache]: Analyzing trace with hash -198617508, now seen corresponding path program 1 times [2023-08-25 21:16:53,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:16:53,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393053783] [2023-08-25 21:16:53,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:53,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:16:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:54,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 21:16:54,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:16:54,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393053783] [2023-08-25 21:16:54,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393053783] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:16:54,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:16:54,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-25 21:16:54,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32898362] [2023-08-25 21:16:54,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:16:54,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-25 21:16:54,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:16:54,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-25 21:16:54,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-25 21:16:54,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 531 [2023-08-25 21:16:54,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 108 transitions, 580 flow. Second operand has 10 states, 10 states have (on average 190.7) internal successors, (1907), 10 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:54,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:16:54,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 531 [2023-08-25 21:16:54,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:16:55,644 INFO L124 PetriNetUnfolderBase]: 11351/15548 cut-off events. [2023-08-25 21:16:55,644 INFO L125 PetriNetUnfolderBase]: For 12882/13242 co-relation queries the response was YES. [2023-08-25 21:16:55,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43027 conditions, 15548 events. 11351/15548 cut-off events. For 12882/13242 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 93720 event pairs, 1386 based on Foata normal form. 453/13722 useless extension candidates. Maximal degree in co-relation 43005. Up to 5866 conditions per place. [2023-08-25 21:16:55,767 INFO L140 encePairwiseOnDemand]: 525/531 looper letters, 200 selfloop transitions, 8 changer transitions 0/219 dead transitions. [2023-08-25 21:16:55,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 219 transitions, 1508 flow [2023-08-25 21:16:55,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-25 21:16:55,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-25 21:16:55,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1442 transitions. [2023-08-25 21:16:55,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3879472693032015 [2023-08-25 21:16:55,770 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1442 transitions. [2023-08-25 21:16:55,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1442 transitions. [2023-08-25 21:16:55,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:16:55,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1442 transitions. [2023-08-25 21:16:55,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:55,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 531.0) internal successors, (4248), 8 states have internal predecessors, (4248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:55,777 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 531.0) internal successors, (4248), 8 states have internal predecessors, (4248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:55,778 INFO L175 Difference]: Start difference. First operand has 98 places, 108 transitions, 580 flow. Second operand 7 states and 1442 transitions. [2023-08-25 21:16:55,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 219 transitions, 1508 flow [2023-08-25 21:16:55,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 219 transitions, 1487 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 21:16:55,869 INFO L231 Difference]: Finished difference. Result has 99 places, 107 transitions, 571 flow [2023-08-25 21:16:55,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=571, PETRI_PLACES=99, PETRI_TRANSITIONS=107} [2023-08-25 21:16:55,870 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 9 predicate places. [2023-08-25 21:16:55,870 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 107 transitions, 571 flow [2023-08-25 21:16:55,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 190.7) internal successors, (1907), 10 states have internal predecessors, (1907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:55,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:16:55,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:16:55,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 21:16:55,871 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 21:16:55,871 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:16:55,871 INFO L85 PathProgramCache]: Analyzing trace with hash 400247658, now seen corresponding path program 1 times [2023-08-25 21:16:55,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:16:55,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119298129] [2023-08-25 21:16:55,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:55,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:16:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:56,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 21:16:56,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:16:56,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119298129] [2023-08-25 21:16:56,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119298129] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:16:56,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:16:56,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-25 21:16:56,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982038631] [2023-08-25 21:16:56,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:16:56,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-25 21:16:56,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:16:56,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-25 21:16:56,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-25 21:16:56,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 531 [2023-08-25 21:16:56,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 107 transitions, 571 flow. Second operand has 8 states, 8 states have (on average 179.375) internal successors, (1435), 8 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:56,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:16:56,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 531 [2023-08-25 21:16:56,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:16:59,588 INFO L124 PetriNetUnfolderBase]: 29705/41915 cut-off events. [2023-08-25 21:16:59,589 INFO L125 PetriNetUnfolderBase]: For 42536/42766 co-relation queries the response was YES. [2023-08-25 21:16:59,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116043 conditions, 41915 events. 29705/41915 cut-off events. For 42536/42766 co-relation queries the response was YES. Maximal size of possible extension queue 1887. Compared 289236 event pairs, 5053 based on Foata normal form. 0/36586 useless extension candidates. Maximal degree in co-relation 116022. Up to 15629 conditions per place. [2023-08-25 21:16:59,807 INFO L140 encePairwiseOnDemand]: 521/531 looper letters, 253 selfloop transitions, 54 changer transitions 0/314 dead transitions. [2023-08-25 21:16:59,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 314 transitions, 2475 flow [2023-08-25 21:16:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-25 21:16:59,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-25 21:16:59,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1567 transitions. [2023-08-25 21:16:59,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.368879472693032 [2023-08-25 21:16:59,811 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1567 transitions. [2023-08-25 21:16:59,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1567 transitions. [2023-08-25 21:16:59,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:16:59,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1567 transitions. [2023-08-25 21:16:59,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 195.875) internal successors, (1567), 8 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:59,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 531.0) internal successors, (4779), 9 states have internal predecessors, (4779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:59,818 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 531.0) internal successors, (4779), 9 states have internal predecessors, (4779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:16:59,818 INFO L175 Difference]: Start difference. First operand has 99 places, 107 transitions, 571 flow. Second operand 8 states and 1567 transitions. [2023-08-25 21:16:59,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 314 transitions, 2475 flow [2023-08-25 21:16:59,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 314 transitions, 2418 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-25 21:17:00,002 INFO L231 Difference]: Finished difference. Result has 105 places, 154 transitions, 1173 flow [2023-08-25 21:17:00,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1173, PETRI_PLACES=105, PETRI_TRANSITIONS=154} [2023-08-25 21:17:00,002 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 15 predicate places. [2023-08-25 21:17:00,003 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 154 transitions, 1173 flow [2023-08-25 21:17:00,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 179.375) internal successors, (1435), 8 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:17:00,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:17:00,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:17:00,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 21:17:00,003 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 21:17:00,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:17:00,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1638471860, now seen corresponding path program 2 times [2023-08-25 21:17:00,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:17:00,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493156785] [2023-08-25 21:17:00,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:17:00,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:17:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:17:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 21:17:00,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:17:00,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493156785] [2023-08-25 21:17:00,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493156785] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:17:00,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:17:00,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-25 21:17:00,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382422463] [2023-08-25 21:17:00,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:17:00,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-25 21:17:00,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:17:00,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-25 21:17:00,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-25 21:17:00,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 531 [2023-08-25 21:17:00,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 154 transitions, 1173 flow. Second operand has 8 states, 8 states have (on average 179.375) internal successors, (1435), 8 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:17:00,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:17:00,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 531 [2023-08-25 21:17:00,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:17:05,872 INFO L124 PetriNetUnfolderBase]: 44776/62123 cut-off events. [2023-08-25 21:17:05,872 INFO L125 PetriNetUnfolderBase]: For 83139/83449 co-relation queries the response was YES. [2023-08-25 21:17:06,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187862 conditions, 62123 events. 44776/62123 cut-off events. For 83139/83449 co-relation queries the response was YES. Maximal size of possible extension queue 2721. Compared 436136 event pairs, 10906 based on Foata normal form. 204/55960 useless extension candidates. Maximal degree in co-relation 187837. Up to 35215 conditions per place. [2023-08-25 21:17:06,364 INFO L140 encePairwiseOnDemand]: 521/531 looper letters, 302 selfloop transitions, 59 changer transitions 0/368 dead transitions. [2023-08-25 21:17:06,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 368 transitions, 3344 flow [2023-08-25 21:17:06,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-25 21:17:06,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-25 21:17:06,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1574 transitions. [2023-08-25 21:17:06,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3705273069679849 [2023-08-25 21:17:06,368 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1574 transitions. [2023-08-25 21:17:06,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1574 transitions. [2023-08-25 21:17:06,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:17:06,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1574 transitions. [2023-08-25 21:17:06,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 196.75) internal successors, (1574), 8 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:17:06,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 531.0) internal successors, (4779), 9 states have internal predecessors, (4779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:17:06,374 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 531.0) internal successors, (4779), 9 states have internal predecessors, (4779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:17:06,374 INFO L175 Difference]: Start difference. First operand has 105 places, 154 transitions, 1173 flow. Second operand 8 states and 1574 transitions. [2023-08-25 21:17:06,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 368 transitions, 3344 flow [2023-08-25 21:17:06,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 368 transitions, 3339 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 21:17:06,880 INFO L231 Difference]: Finished difference. Result has 114 places, 202 transitions, 1911 flow [2023-08-25 21:17:06,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1911, PETRI_PLACES=114, PETRI_TRANSITIONS=202} [2023-08-25 21:17:06,880 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 24 predicate places. [2023-08-25 21:17:06,880 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 202 transitions, 1911 flow [2023-08-25 21:17:06,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 179.375) internal successors, (1435), 8 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:17:06,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:17:06,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:17:06,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 21:17:06,881 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 21:17:06,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:17:06,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1526112448, now seen corresponding path program 1 times [2023-08-25 21:17:06,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:17:06,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518622685] [2023-08-25 21:17:06,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:17:06,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:17:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:17:07,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:17:07,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:17:07,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518622685] [2023-08-25 21:17:07,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518622685] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:17:07,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:17:07,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:17:07,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509514688] [2023-08-25 21:17:07,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:17:07,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:17:07,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:17:07,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:17:07,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:17:07,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 531 [2023-08-25 21:17:07,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 202 transitions, 1911 flow. Second operand has 6 states, 6 states have (on average 210.66666666666666) internal successors, (1264), 6 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:17:07,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:17:07,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 531 [2023-08-25 21:17:07,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:17:12,393 INFO L124 PetriNetUnfolderBase]: 38688/53524 cut-off events. [2023-08-25 21:17:12,393 INFO L125 PetriNetUnfolderBase]: For 128677/132586 co-relation queries the response was YES. [2023-08-25 21:17:12,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183954 conditions, 53524 events. 38688/53524 cut-off events. For 128677/132586 co-relation queries the response was YES. Maximal size of possible extension queue 2450. Compared 366413 event pairs, 14957 based on Foata normal form. 1239/48834 useless extension candidates. Maximal degree in co-relation 183925. Up to 48170 conditions per place. [2023-08-25 21:17:12,878 INFO L140 encePairwiseOnDemand]: 524/531 looper letters, 230 selfloop transitions, 17 changer transitions 0/263 dead transitions. [2023-08-25 21:17:12,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 263 transitions, 2793 flow [2023-08-25 21:17:12,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:17:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:17:12,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1333 transitions. [2023-08-25 21:17:12,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41839296924042685 [2023-08-25 21:17:12,889 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1333 transitions. [2023-08-25 21:17:12,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1333 transitions. [2023-08-25 21:17:12,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:17:12,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1333 transitions. [2023-08-25 21:17:12,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 222.16666666666666) internal successors, (1333), 6 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:17:12,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:17:12,894 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 531.0) internal successors, (3717), 7 states have internal predecessors, (3717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:17:12,894 INFO L175 Difference]: Start difference. First operand has 114 places, 202 transitions, 1911 flow. Second operand 6 states and 1333 transitions. [2023-08-25 21:17:12,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 263 transitions, 2793 flow [2023-08-25 21:17:13,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 263 transitions, 2718 flow, removed 35 selfloop flow, removed 2 redundant places. [2023-08-25 21:17:13,591 INFO L231 Difference]: Finished difference. Result has 122 places, 218 transitions, 2084 flow [2023-08-25 21:17:13,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=1836, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2084, PETRI_PLACES=122, PETRI_TRANSITIONS=218} [2023-08-25 21:17:13,592 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 32 predicate places. [2023-08-25 21:17:13,592 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 218 transitions, 2084 flow [2023-08-25 21:17:13,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.66666666666666) internal successors, (1264), 6 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:17:13,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:17:13,592 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:17:13,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-25 21:17:13,592 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 21:17:13,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:17:13,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1131525155, now seen corresponding path program 1 times [2023-08-25 21:17:13,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:17:13,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064028763] [2023-08-25 21:17:13,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:17:13,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:17:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:17:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:17:13,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:17:13,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064028763] [2023-08-25 21:17:13,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064028763] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:17:13,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765516454] [2023-08-25 21:17:13,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:17:13,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:17:13,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:17:13,678 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:17:13,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-25 21:17:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:17:13,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-25 21:17:13,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:17:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:17:13,910 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:17:13,960 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:17:13,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765516454] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:17:13,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:17:13,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-08-25 21:17:13,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225605255] [2023-08-25 21:17:13,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:17:13,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-25 21:17:13,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:17:13,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-25 21:17:13,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-08-25 21:17:13,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 531 [2023-08-25 21:17:13,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 218 transitions, 2084 flow. Second operand has 14 states, 14 states have (on average 200.07142857142858) internal successors, (2801), 14 states have internal predecessors, (2801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:17:13,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:17:13,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 531 [2023-08-25 21:17:13,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:17:17,967 INFO L124 PetriNetUnfolderBase]: 21124/38109 cut-off events. [2023-08-25 21:17:17,968 INFO L125 PetriNetUnfolderBase]: For 162007/172909 co-relation queries the response was YES. [2023-08-25 21:17:18,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127898 conditions, 38109 events. 21124/38109 cut-off events. For 162007/172909 co-relation queries the response was YES. Maximal size of possible extension queue 1913. Compared 360731 event pairs, 5632 based on Foata normal form. 4337/38560 useless extension candidates. Maximal degree in co-relation 127865. Up to 15733 conditions per place. [2023-08-25 21:17:18,245 INFO L140 encePairwiseOnDemand]: 522/531 looper letters, 337 selfloop transitions, 32 changer transitions 0/413 dead transitions. [2023-08-25 21:17:18,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 413 transitions, 4686 flow [2023-08-25 21:17:18,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-25 21:17:18,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-25 21:17:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2075 transitions. [2023-08-25 21:17:18,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3907721280602637 [2023-08-25 21:17:18,251 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2075 transitions. [2023-08-25 21:17:18,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2075 transitions. [2023-08-25 21:17:18,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:17:18,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2075 transitions. [2023-08-25 21:17:18,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 207.5) internal successors, (2075), 10 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:17:18,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 531.0) internal successors, (5841), 11 states have internal predecessors, (5841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:17:18,260 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 531.0) internal successors, (5841), 11 states have internal predecessors, (5841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:17:18,260 INFO L175 Difference]: Start difference. First operand has 122 places, 218 transitions, 2084 flow. Second operand 10 states and 2075 transitions. [2023-08-25 21:17:18,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 413 transitions, 4686 flow [2023-08-25 21:17:18,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 413 transitions, 4662 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-08-25 21:17:18,699 INFO L231 Difference]: Finished difference. Result has 136 places, 237 transitions, 2416 flow [2023-08-25 21:17:18,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=2068, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2416, PETRI_PLACES=136, PETRI_TRANSITIONS=237} [2023-08-25 21:17:18,700 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 46 predicate places. [2023-08-25 21:17:18,700 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 237 transitions, 2416 flow [2023-08-25 21:17:18,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 200.07142857142858) internal successors, (2801), 14 states have internal predecessors, (2801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:17:18,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:17:18,701 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:17:18,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-25 21:17:18,905 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,SelfDestructingSolverStorable11 [2023-08-25 21:17:18,905 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 21:17:18,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:17:18,906 INFO L85 PathProgramCache]: Analyzing trace with hash -719744885, now seen corresponding path program 2 times [2023-08-25 21:17:18,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:17:18,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850827852] [2023-08-25 21:17:18,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:17:18,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:17:18,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:17:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 21:17:19,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:17:19,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850827852] [2023-08-25 21:17:19,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850827852] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:17:19,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482700016] [2023-08-25 21:17:19,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 21:17:19,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:17:19,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:17:19,666 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:17:19,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-25 21:17:19,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 21:17:19,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 21:17:19,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-25 21:17:19,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:17:19,914 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-25 21:17:19,915 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2023-08-25 21:17:19,961 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-25 21:17:19,962 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-25 21:17:20,104 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 21:17:20,135 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-25 21:17:20,173 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-25 21:17:20,223 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-08-25 21:17:20,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:17:20,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:17:20,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:17:20,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:17:20,309 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2023-08-25 21:17:20,318 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2023-08-25 21:17:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 21:17:24,413 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 21:17:24,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482700016] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:17:24,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 21:17:24,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 22 [2023-08-25 21:17:24,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330559749] [2023-08-25 21:17:24,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:17:24,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-25 21:17:24,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:17:24,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-25 21:17:24,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=427, Unknown=1, NotChecked=0, Total=552 [2023-08-25 21:17:24,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 531 [2023-08-25 21:17:24,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 237 transitions, 2416 flow. Second operand has 13 states, 13 states have (on average 178.6153846153846) internal successors, (2322), 13 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:17:24,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:17:24,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 531 [2023-08-25 21:17:24,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:17:30,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:17:32,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:17:39,330 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 [0] [2023-08-25 21:17:41,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:17:43,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:17:45,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:17:48,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:17:56,455 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 [0] [2023-08-25 21:18:03,374 INFO L124 PetriNetUnfolderBase]: 81894/118899 cut-off events. [2023-08-25 21:18:03,374 INFO L125 PetriNetUnfolderBase]: For 396476/396710 co-relation queries the response was YES. [2023-08-25 21:18:04,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412724 conditions, 118899 events. 81894/118899 cut-off events. For 396476/396710 co-relation queries the response was YES. Maximal size of possible extension queue 5325. Compared 965101 event pairs, 10281 based on Foata normal form. 258/107425 useless extension candidates. Maximal degree in co-relation 412685. Up to 38244 conditions per place. [2023-08-25 21:18:04,883 INFO L140 encePairwiseOnDemand]: 517/531 looper letters, 481 selfloop transitions, 67 changer transitions 0/555 dead transitions. [2023-08-25 21:18:04,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 555 transitions, 5898 flow [2023-08-25 21:18:04,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-25 21:18:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-25 21:18:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2534 transitions. [2023-08-25 21:18:04,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3670867738664349 [2023-08-25 21:18:04,887 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2534 transitions. [2023-08-25 21:18:04,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2534 transitions. [2023-08-25 21:18:04,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:18:04,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2534 transitions. [2023-08-25 21:18:04,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 194.92307692307693) internal successors, (2534), 13 states have internal predecessors, (2534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:18:04,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 531.0) internal successors, (7434), 14 states have internal predecessors, (7434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:18:04,897 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 531.0) internal successors, (7434), 14 states have internal predecessors, (7434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:18:04,897 INFO L175 Difference]: Start difference. First operand has 136 places, 237 transitions, 2416 flow. Second operand 13 states and 2534 transitions. [2023-08-25 21:18:04,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 555 transitions, 5898 flow [2023-08-25 21:18:10,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 555 transitions, 5834 flow, removed 29 selfloop flow, removed 1 redundant places. [2023-08-25 21:18:10,612 INFO L231 Difference]: Finished difference. Result has 155 places, 272 transitions, 2997 flow [2023-08-25 21:18:10,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=2382, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2997, PETRI_PLACES=155, PETRI_TRANSITIONS=272} [2023-08-25 21:18:10,612 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 65 predicate places. [2023-08-25 21:18:10,612 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 272 transitions, 2997 flow [2023-08-25 21:18:10,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 178.6153846153846) internal successors, (2322), 13 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:18:10,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:18:10,613 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:18:10,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-25 21:18:10,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-25 21:18:10,814 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 21:18:10,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:18:10,814 INFO L85 PathProgramCache]: Analyzing trace with hash -236810947, now seen corresponding path program 3 times [2023-08-25 21:18:10,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:18:10,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715766397] [2023-08-25 21:18:10,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:18:10,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:18:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:18:11,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 21:18:11,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:18:11,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715766397] [2023-08-25 21:18:11,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715766397] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:18:11,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552840856] [2023-08-25 21:18:11,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 21:18:11,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:18:11,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:18:11,493 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:18:11,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-25 21:18:11,676 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-25 21:18:11,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 21:18:11,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-25 21:18:11,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:18:11,716 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-25 21:18:11,717 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2023-08-25 21:18:11,749 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-25 21:18:11,749 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-25 21:18:11,851 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 21:18:11,882 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-25 21:18:11,913 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-25 21:18:11,948 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-08-25 21:18:12,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:18:12,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:18:12,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:18:12,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:18:12,054 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2023-08-25 21:18:12,060 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2023-08-25 21:18:18,119 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 21:18:18,119 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 21:18:18,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552840856] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:18:18,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 21:18:18,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 22 [2023-08-25 21:18:18,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119444265] [2023-08-25 21:18:18,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:18:18,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-25 21:18:18,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:18:18,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-25 21:18:18,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=439, Unknown=2, NotChecked=0, Total=552 [2023-08-25 21:18:18,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 531 [2023-08-25 21:18:18,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 272 transitions, 2997 flow. Second operand has 13 states, 13 states have (on average 178.6153846153846) internal successors, (2322), 13 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:18:18,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:18:18,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 531 [2023-08-25 21:18:18,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:18:23,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:18:25,147 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 [0] [2023-08-25 21:18:27,324 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 [0] [2023-08-25 21:18:29,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:18:31,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:18:33,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:18:35,565 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 [0] [2023-08-25 21:18:40,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:18:42,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:18:44,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:18:46,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:18:48,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:18:50,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:18:53,274 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 [0] [2023-08-25 21:19:02,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:19:15,992 INFO L124 PetriNetUnfolderBase]: 84960/119323 cut-off events. [2023-08-25 21:19:15,993 INFO L125 PetriNetUnfolderBase]: For 535445/536579 co-relation queries the response was YES. [2023-08-25 21:19:17,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460274 conditions, 119323 events. 84960/119323 cut-off events. For 535445/536579 co-relation queries the response was YES. Maximal size of possible extension queue 5098. Compared 908144 event pairs, 14186 based on Foata normal form. 654/107589 useless extension candidates. Maximal degree in co-relation 460227. Up to 40491 conditions per place. [2023-08-25 21:19:17,557 INFO L140 encePairwiseOnDemand]: 517/531 looper letters, 457 selfloop transitions, 131 changer transitions 0/595 dead transitions. [2023-08-25 21:19:17,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 595 transitions, 6917 flow [2023-08-25 21:19:17,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-25 21:19:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-25 21:19:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2516 transitions. [2023-08-25 21:19:17,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3644792119368391 [2023-08-25 21:19:17,570 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2516 transitions. [2023-08-25 21:19:17,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2516 transitions. [2023-08-25 21:19:17,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:19:17,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2516 transitions. [2023-08-25 21:19:17,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 193.53846153846155) internal successors, (2516), 13 states have internal predecessors, (2516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:17,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 531.0) internal successors, (7434), 14 states have internal predecessors, (7434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:17,602 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 531.0) internal successors, (7434), 14 states have internal predecessors, (7434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:17,602 INFO L175 Difference]: Start difference. First operand has 155 places, 272 transitions, 2997 flow. Second operand 13 states and 2516 transitions. [2023-08-25 21:19:17,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 595 transitions, 6917 flow [2023-08-25 21:19:26,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 595 transitions, 6639 flow, removed 111 selfloop flow, removed 3 redundant places. [2023-08-25 21:19:26,455 INFO L231 Difference]: Finished difference. Result has 172 places, 346 transitions, 4206 flow [2023-08-25 21:19:26,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=2857, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=4206, PETRI_PLACES=172, PETRI_TRANSITIONS=346} [2023-08-25 21:19:26,456 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 82 predicate places. [2023-08-25 21:19:26,456 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 346 transitions, 4206 flow [2023-08-25 21:19:26,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 178.6153846153846) internal successors, (2322), 13 states have internal predecessors, (2322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:26,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:19:26,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:19:26,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-25 21:19:26,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:19:26,661 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 21:19:26,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:19:26,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1421222234, now seen corresponding path program 1 times [2023-08-25 21:19:26,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:19:26,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601498476] [2023-08-25 21:19:26,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:19:26,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:19:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:19:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:19:26,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:19:26,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601498476] [2023-08-25 21:19:26,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601498476] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:19:26,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24847759] [2023-08-25 21:19:26,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:19:26,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:19:26,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:19:26,730 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:19:26,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-25 21:19:26,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:19:26,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-25 21:19:26,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:19:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:19:26,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:19:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:19:26,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24847759] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-25 21:19:26,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-25 21:19:26,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-08-25 21:19:26,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810390686] [2023-08-25 21:19:26,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:19:26,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 21:19:26,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:19:26,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 21:19:26,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-25 21:19:26,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 531 [2023-08-25 21:19:26,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 346 transitions, 4206 flow. Second operand has 5 states, 5 states have (on average 194.2) internal successors, (971), 5 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:26,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:19:26,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 531 [2023-08-25 21:19:26,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:19:34,880 INFO L124 PetriNetUnfolderBase]: 40938/62420 cut-off events. [2023-08-25 21:19:34,880 INFO L125 PetriNetUnfolderBase]: For 398632/411033 co-relation queries the response was YES. [2023-08-25 21:19:35,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268619 conditions, 62420 events. 40938/62420 cut-off events. For 398632/411033 co-relation queries the response was YES. Maximal size of possible extension queue 3095. Compared 509306 event pairs, 11272 based on Foata normal form. 2341/57681 useless extension candidates. Maximal degree in co-relation 268564. Up to 46189 conditions per place. [2023-08-25 21:19:35,814 INFO L140 encePairwiseOnDemand]: 523/531 looper letters, 288 selfloop transitions, 42 changer transitions 8/375 dead transitions. [2023-08-25 21:19:35,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 375 transitions, 5024 flow [2023-08-25 21:19:35,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 21:19:35,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 21:19:35,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1027 transitions. [2023-08-25 21:19:35,817 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38681732580037664 [2023-08-25 21:19:35,817 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1027 transitions. [2023-08-25 21:19:35,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1027 transitions. [2023-08-25 21:19:35,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:19:35,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1027 transitions. [2023-08-25 21:19:35,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 205.4) internal successors, (1027), 5 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:35,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 531.0) internal successors, (3186), 6 states have internal predecessors, (3186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:35,821 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 531.0) internal successors, (3186), 6 states have internal predecessors, (3186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:35,821 INFO L175 Difference]: Start difference. First operand has 172 places, 346 transitions, 4206 flow. Second operand 5 states and 1027 transitions. [2023-08-25 21:19:35,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 375 transitions, 5024 flow [2023-08-25 21:19:40,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 375 transitions, 4913 flow, removed 51 selfloop flow, removed 2 redundant places. [2023-08-25 21:19:40,399 INFO L231 Difference]: Finished difference. Result has 176 places, 330 transitions, 4046 flow [2023-08-25 21:19:40,399 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=3906, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=4046, PETRI_PLACES=176, PETRI_TRANSITIONS=330} [2023-08-25 21:19:40,399 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 86 predicate places. [2023-08-25 21:19:40,400 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 330 transitions, 4046 flow [2023-08-25 21:19:40,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 194.2) internal successors, (971), 5 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:40,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:19:40,400 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:19:40,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-25 21:19:40,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-25 21:19:40,605 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 21:19:40,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:19:40,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2112585811, now seen corresponding path program 1 times [2023-08-25 21:19:40,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:19:40,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307180434] [2023-08-25 21:19:40,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:19:40,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:19:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:19:41,118 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 21:19:41,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:19:41,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307180434] [2023-08-25 21:19:41,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307180434] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:19:41,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894343137] [2023-08-25 21:19:41,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:19:41,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:19:41,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:19:41,121 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 21:19:41,122 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 21:19:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:19:41,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-25 21:19:41,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:19:41,337 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-25 21:19:41,337 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2023-08-25 21:19:41,369 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-25 21:19:41,369 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-25 21:19:41,491 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 21:19:41,571 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-25 21:19:41,604 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-25 21:19:41,641 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-08-25 21:19:41,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:19:41,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:19:41,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:19:41,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:19:41,716 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2023-08-25 21:19:41,721 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2023-08-25 21:19:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 21:19:45,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:19:58,725 INFO L322 Elim1Store]: treesize reduction 87, result has 54.2 percent of original size [2023-08-25 21:19:58,725 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 81 treesize of output 117 [2023-08-25 21:19:58,739 INFO L322 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-08-25 21:19:58,739 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 132 treesize of output 54 [2023-08-25 21:19:58,745 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-08-25 21:19:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 21:19:58,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894343137] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:19:58,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:19:58,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 29 [2023-08-25 21:19:58,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450136109] [2023-08-25 21:19:58,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:19:58,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-25 21:19:58,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:19:58,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-25 21:19:58,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=696, Unknown=56, NotChecked=0, Total=930 [2023-08-25 21:19:58,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 531 [2023-08-25 21:19:58,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 330 transitions, 4046 flow. Second operand has 31 states, 31 states have (on average 179.0) internal successors, (5549), 31 states have internal predecessors, (5549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:58,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:19:58,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 531 [2023-08-25 21:19:58,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:20:07,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:20:09,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:20:16,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:20:18,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:20:23,770 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 [0] [2023-08-25 21:20:25,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:20:27,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:20:29,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:20:31,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:20:33,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:20:35,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:20:44,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:20:46,486 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 [0] [2023-08-25 21:20:48,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:20:50,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:20:52,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:20:56,827 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 [0] [2023-08-25 21:20:58,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:21:20,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:21:24,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:21:44,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:22:05,967 INFO L124 PetriNetUnfolderBase]: 129919/184176 cut-off events. [2023-08-25 21:22:05,967 INFO L125 PetriNetUnfolderBase]: For 975395/977465 co-relation queries the response was YES. [2023-08-25 21:22:08,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771410 conditions, 184176 events. 129919/184176 cut-off events. For 975395/977465 co-relation queries the response was YES. Maximal size of possible extension queue 7422. Compared 1494840 event pairs, 6714 based on Foata normal form. 1385/166905 useless extension candidates. Maximal degree in co-relation 771353. Up to 27114 conditions per place. [2023-08-25 21:22:08,940 INFO L140 encePairwiseOnDemand]: 501/531 looper letters, 971 selfloop transitions, 580 changer transitions 0/1558 dead transitions. [2023-08-25 21:22:08,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 1558 transitions, 18139 flow [2023-08-25 21:22:08,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-25 21:22:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-08-25 21:22:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 7601 transitions. [2023-08-25 21:22:08,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3670384856825535 [2023-08-25 21:22:08,949 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 7601 transitions. [2023-08-25 21:22:08,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 7601 transitions. [2023-08-25 21:22:08,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:22:08,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 7601 transitions. [2023-08-25 21:22:08,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 194.89743589743588) internal successors, (7601), 39 states have internal predecessors, (7601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:08,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 531.0) internal successors, (21240), 40 states have internal predecessors, (21240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:09,000 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 531.0) internal successors, (21240), 40 states have internal predecessors, (21240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:09,000 INFO L175 Difference]: Start difference. First operand has 176 places, 330 transitions, 4046 flow. Second operand 39 states and 7601 transitions. [2023-08-25 21:22:09,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 1558 transitions, 18139 flow [2023-08-25 21:22:37,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 1558 transitions, 17847 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-08-25 21:22:37,382 INFO L231 Difference]: Finished difference. Result has 236 places, 771 transitions, 11442 flow [2023-08-25 21:22:37,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=531, PETRI_DIFFERENCE_MINUEND_FLOW=3942, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=11442, PETRI_PLACES=236, PETRI_TRANSITIONS=771} [2023-08-25 21:22:37,383 INFO L281 CegarLoopForPetriNet]: 90 programPoint places, 146 predicate places. [2023-08-25 21:22:37,383 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 771 transitions, 11442 flow [2023-08-25 21:22:37,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 179.0) internal successors, (5549), 31 states have internal predecessors, (5549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:37,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:22:37,384 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:22:37,392 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 21:22:37,589 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,SelfDestructingSolverStorable15 [2023-08-25 21:22:37,589 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2023-08-25 21:22:37,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:22:37,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1286806641, now seen corresponding path program 2 times [2023-08-25 21:22:37,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:22:37,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608650000] [2023-08-25 21:22:37,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:22:37,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:22:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:22:38,233 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 21:22:38,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:22:38,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608650000] [2023-08-25 21:22:38,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608650000] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:22:38,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629465133] [2023-08-25 21:22:38,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 21:22:38,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:22:38,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:22:38,249 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 21:22:38,251 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 21:22:38,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 21:22:38,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 21:22:38,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-25 21:22:38,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:22:38,447 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-25 21:22:38,448 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 42 [2023-08-25 21:22:38,482 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-25 21:22:38,483 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-25 21:22:38,602 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 21:22:38,633 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-08-25 21:22:38,665 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-08-25 21:22:38,731 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-08-25 21:22:38,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:22:38,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:22:38,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:22:38,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:22:38,802 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 89 [2023-08-25 21:22:38,806 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2023-08-25 21:22:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 21:22:42,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:22:43,157 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_thread1Thread1of1ForFork2_~i~0 4))) (let ((.cse1 (+ c_~A~0.offset .cse2 3))) (let ((.cse0 (store |c_#race| c_~A~0.base (let ((.cse3 (* c_thread2Thread1of1ForFork0_~i~1 4))) (store (store (store (store (store (select |c_#race| c_~A~0.base) .cse1 0) (+ .cse3 c_~A~0.offset) 0) (+ .cse3 c_~A~0.offset 1) 0) (+ .cse3 c_~A~0.offset 2) 0) (+ .cse3 c_~A~0.offset 3) 0))))) (and (forall ((v_ArrVal_1492 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_1492) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1492 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_1492) c_~A~0.base) (+ c_~A~0.offset 2 .cse2)) 0)) (forall ((v_ArrVal_1492 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_1492) c_~A~0.base) (+ c_~A~0.offset .cse2 1)) 0)) (forall ((v_ArrVal_1492 (Array Int Int))) (= 0 (select (select (store .cse0 c_~C~0.base v_ArrVal_1492) c_~A~0.base) (+ c_~A~0.offset .cse2)))))))) is different from false [2023-08-25 21:22:51,439 WARN L234 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 55 DAG size of output: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:23:05,906 INFO L322 Elim1Store]: treesize reduction 87, result has 54.2 percent of original size [2023-08-25 21:23:05,907 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 81 treesize of output 117 [2023-08-25 21:23:05,913 INFO L322 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-08-25 21:23:05,914 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 132 treesize of output 54 [2023-08-25 21:23:05,919 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-08-25 21:23:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 21:23:05,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629465133] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:23:05,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:23:05,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 29 [2023-08-25 21:23:05,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91632562] [2023-08-25 21:23:05,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:23:05,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-25 21:23:05,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:23:05,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-25 21:23:05,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=696, Unknown=15, NotChecked=56, Total=930 [2023-08-25 21:23:05,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 531 [2023-08-25 21:23:05,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 771 transitions, 11442 flow. Second operand has 31 states, 31 states have (on average 179.0) internal successors, (5549), 31 states have internal predecessors, (5549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:23:05,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:23:05,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 531 [2023-08-25 21:23:05,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:23:10,501 WARN L839 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) 1) (not (= c_~C~0.base c_~A~0.base)) (not (= |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| c_~A~0.base)) (= c_~A~0.offset 0) (forall ((v_thread2Thread1of1ForFork0_~i~1_72 Int)) (or (< v_thread2Thread1of1ForFork0_~i~1_72 (+ c_thread2Thread1of1ForFork0_~i~1 1)) (forall ((v_ArrVal_1492 (Array Int Int))) (= (let ((.cse0 (* c_thread1Thread1of1ForFork2_~i~0 4))) (select (select (store (store |c_#race| c_~A~0.base (let ((.cse1 (* v_thread2Thread1of1ForFork0_~i~1_72 4))) (store (store (store (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse0 1) 0) (+ c_~A~0.offset 2 .cse0) 0) (+ c_~A~0.offset .cse0 3) 0) (+ c_~A~0.offset .cse1) 0) (+ c_~A~0.offset .cse1 1) 0) (+ c_~A~0.offset .cse1 2) 0) (+ c_~A~0.offset .cse1 3) 0))) c_~C~0.base v_ArrVal_1492) c_~A~0.base) (+ c_~A~0.offset .cse0))) 0))))) is different from false [2023-08-25 21:23:12,569 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 [0] [2023-08-25 21:23:14,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:23:16,796 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 [0] [2023-08-25 21:23:20,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:23:22,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 [1] [2023-08-25 21:23:24,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:23:26,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:23:28,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:23:30,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:23:33,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 [1] [2023-08-25 21:23:35,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:23:37,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:23:39,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:23:41,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:23:43,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:23:45,378 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 [0] [2023-08-25 21:23:47,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:23:49,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:23:51,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:23:53,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:23:55,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:23:57,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:23:59,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:24:01,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:03,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:05,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:07,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:10,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:12,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:14,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:16,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:18,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:20,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:22,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:24,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:26,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:28,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:30,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:32,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:34,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:36,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:39,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:41,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:43,074 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 [0] [2023-08-25 21:24:45,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:24:46,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:48,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:50,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:52,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:54,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:56,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:24:58,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:25:00,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:25:02,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:25:25,910 WARN L234 SmtUtils]: Spent 11.60s on a formula simplification. DAG size of input: 57 DAG size of output: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:25:27,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:25:29,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:25:31,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:25:33,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:25:36,141 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 [0] [2023-08-25 21:25:38,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:25:40,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:25:42,289 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 [0] [2023-08-25 21:25:44,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:25:46,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:25:48,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:25:50,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:25:52,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:25:54,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:25:57,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:25:59,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:26:10,980 WARN L234 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 61 DAG size of output: 59 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:26:13,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:26:19,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:26:21,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:26:23,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:26:26,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:26:28,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:26:45,454 WARN L234 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 54 DAG size of output: 52 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:26:48,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:26:50,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:26:52,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:26:54,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:26:56,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:26:58,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:27:15,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:27:17,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:27:19,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:27:22,047 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 [0] [2023-08-25 21:27:28,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:27:30,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:27:32,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:27:34,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:27:36,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:27:39,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:27:41,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:27:43,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:27:45,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:27:47,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:27:49,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:27:51,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:27:53,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:28:09,892 WARN L234 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 62 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:28:19,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:28:23,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:28:25,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:28:27,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:28:29,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:28:31,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:28:33,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:28:35,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:28:38,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:28:40,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:28:42,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:28:44,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:28:46,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:29:03,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:29:07,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:29:09,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:29:27,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:29:29,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:29:32,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:29:34,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:29:36,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:29:38,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:29:55,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:29:57,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:29:59,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:30:01,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:30:03,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:30:05,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:30:07,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:30:09,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:30:13,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:30:15,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:30:17,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:30:19,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:30:21,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:30:23,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:30:25,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:30:28,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:30:30,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:30:42,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:30:43,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:30:45,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:30:47,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-08-25 21:30:49,571 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 21:30:49,571 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 21:30:49,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 21:30:50,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-08-25 21:30:50,262 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (50 of 51 remaining) [2023-08-25 21:30:50,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-25 21:30:50,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-25 21:30:50,467 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). [2023-08-25 21:30:50,469 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (49 of 51 remaining) [2023-08-25 21:30:50,469 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 51 remaining) [2023-08-25 21:30:50,469 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 51 remaining) [2023-08-25 21:30:50,469 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 51 remaining) [2023-08-25 21:30:50,469 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 51 remaining) [2023-08-25 21:30:50,469 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (44 of 51 remaining) [2023-08-25 21:30:50,469 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (43 of 51 remaining) [2023-08-25 21:30:50,469 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (42 of 51 remaining) [2023-08-25 21:30:50,469 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (41 of 51 remaining) [2023-08-25 21:30:50,469 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (40 of 51 remaining) [2023-08-25 21:30:50,469 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (39 of 51 remaining) [2023-08-25 21:30:50,469 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (38 of 51 remaining) [2023-08-25 21:30:50,469 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (37 of 51 remaining) [2023-08-25 21:30:50,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (36 of 51 remaining) [2023-08-25 21:30:50,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (35 of 51 remaining) [2023-08-25 21:30:50,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (34 of 51 remaining) [2023-08-25 21:30:50,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (33 of 51 remaining) [2023-08-25 21:30:50,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 51 remaining) [2023-08-25 21:30:50,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (31 of 51 remaining) [2023-08-25 21:30:50,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 51 remaining) [2023-08-25 21:30:50,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 51 remaining) [2023-08-25 21:30:50,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 51 remaining) [2023-08-25 21:30:50,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 51 remaining) [2023-08-25 21:30:50,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 51 remaining) [2023-08-25 21:30:50,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (25 of 51 remaining) [2023-08-25 21:30:50,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (24 of 51 remaining) [2023-08-25 21:30:50,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (23 of 51 remaining) [2023-08-25 21:30:50,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 51 remaining) [2023-08-25 21:30:50,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (21 of 51 remaining) [2023-08-25 21:30:50,470 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (20 of 51 remaining) [2023-08-25 21:30:50,471 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONASSERT (19 of 51 remaining) [2023-08-25 21:30:50,471 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 51 remaining) [2023-08-25 21:30:50,471 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 51 remaining) [2023-08-25 21:30:50,471 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 51 remaining) [2023-08-25 21:30:50,471 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (15 of 51 remaining) [2023-08-25 21:30:50,471 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (14 of 51 remaining) [2023-08-25 21:30:50,471 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 51 remaining) [2023-08-25 21:30:50,471 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (12 of 51 remaining) [2023-08-25 21:30:50,471 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 51 remaining) [2023-08-25 21:30:50,472 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 51 remaining) [2023-08-25 21:30:50,472 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 51 remaining) [2023-08-25 21:30:50,472 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 51 remaining) [2023-08-25 21:30:50,472 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (7 of 51 remaining) [2023-08-25 21:30:50,472 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (6 of 51 remaining) [2023-08-25 21:30:50,472 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 51 remaining) [2023-08-25 21:30:50,472 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 51 remaining) [2023-08-25 21:30:50,472 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 51 remaining) [2023-08-25 21:30:50,472 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 51 remaining) [2023-08-25 21:30:50,472 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 51 remaining) [2023-08-25 21:30:50,472 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 51 remaining) [2023-08-25 21:30:50,472 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:30:50,476 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 21:30:50,476 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 21:30:50,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 09:30:50 BasicIcfg [2023-08-25 21:30:50,478 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 21:30:50,478 INFO L158 Benchmark]: Toolchain (without parser) took 850056.68ms. Allocated memory was 346.0MB in the beginning and 14.4GB in the end (delta: 14.1GB). Free memory was 322.0MB in the beginning and 11.1GB in the end (delta: -10.8GB). Peak memory consumption was 3.7GB. Max. memory is 16.0GB. [2023-08-25 21:30:50,478 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 346.0MB. Free memory is still 322.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 21:30:50,480 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.14ms. Allocated memory is still 346.0MB. Free memory was 321.5MB in the beginning and 309.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-25 21:30:50,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.78ms. Allocated memory is still 346.0MB. Free memory was 309.2MB in the beginning and 307.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 21:30:50,484 INFO L158 Benchmark]: Boogie Preprocessor took 58.26ms. Allocated memory is still 346.0MB. Free memory was 307.1MB in the beginning and 304.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 21:30:50,484 INFO L158 Benchmark]: RCFGBuilder took 686.92ms. Allocated memory is still 346.0MB. Free memory was 304.5MB in the beginning and 264.7MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-08-25 21:30:50,484 INFO L158 Benchmark]: TraceAbstraction took 849099.40ms. Allocated memory was 346.0MB in the beginning and 14.4GB in the end (delta: 14.1GB). Free memory was 321.7MB in the beginning and 11.1GB in the end (delta: -10.8GB). Peak memory consumption was 3.7GB. Max. memory is 16.0GB. [2023-08-25 21:30:50,485 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 346.0MB. Free memory is still 322.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 160.14ms. Allocated memory is still 346.0MB. Free memory was 321.5MB in the beginning and 309.2MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 30.78ms. Allocated memory is still 346.0MB. Free memory was 309.2MB in the beginning and 307.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 58.26ms. Allocated memory is still 346.0MB. Free memory was 307.1MB in the beginning and 304.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 686.92ms. Allocated memory is still 346.0MB. Free memory was 304.5MB in the beginning and 264.7MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 849099.40ms. Allocated memory was 346.0MB in the beginning and 14.4GB in the end (delta: 14.1GB). Free memory was 321.7MB in the beginning and 11.1GB in the end (delta: -10.8GB). Peak memory consumption was 3.7GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 260 PlacesBefore, 90 PlacesAfterwards, 266 TransitionsBefore, 89 TransitionsAfterwards, 7186 CoEnabledTransitionPairs, 8 FixpointIterations, 155 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 19 TrivialYvCompositions, 11 ConcurrentYvCompositions, 7 ChoiceCompositions, 251 TotalNumberOfCompositions, 43304 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15341, independent: 14443, independent conditional: 0, independent unconditional: 14443, dependent: 898, dependent conditional: 0, dependent unconditional: 898, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3792, independent: 3704, independent conditional: 0, independent unconditional: 3704, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15341, independent: 10739, independent conditional: 0, independent unconditional: 10739, dependent: 810, dependent conditional: 0, dependent unconditional: 810, unknown: 3792, unknown conditional: 0, unknown unconditional: 3792] , Statistics on independence cache: Total cache size (in pairs): 784, Positive cache size: 721, Positive conditional cache size: 0, Positive unconditional cache size: 721, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (31states, 177/531 universal loopers) in iteration 17,while PetriNetUnfolder was constructing finite prefix that currently has 203009 conditions, 32187 events (21047/32186 cut-off events. For 395440/397860 co-relation queries the response was YES. Maximal size of possible extension queue 7812. Compared 300571 event pairs, 1969 based on Foata normal form. 189/35825 useless extension candidates. Maximal degree in co-relation 202928. Up to 18610 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 339 locations, 51 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: 849.0s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 779.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 933 mSolverCounterUnknown, 2841 SdHoareTripleChecker+Valid, 411.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2841 mSDsluCounter, 712 SdHoareTripleChecker+Invalid, 408.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1228 IncrementalHoareTripleChecker+Unchecked, 444 mSDsCounter, 761 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8968 IncrementalHoareTripleChecker+Invalid, 11890 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 761 mSolverCounterUnsat, 268 mSDtfsCounter, 8968 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 933 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 534 GetRequests, 235 SyntacticMatches, 11 SemanticMatches, 288 ConstructedPredicates, 2 IntricatePredicates, 3 DeprecatedPredicates, 3379 ImplicationChecksByTransitivity, 279.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11442occurred in iteration=16, InterpolantAutomatonStates: 141, 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, 0.5s SatisfiabilityAnalysisTime, 61.1s InterpolantComputationTime, 529 NumberOfCodeBlocks, 529 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 623 ConstructedInterpolants, 24 QuantifiedInterpolants, 9522 SizeOfPredicates, 47 NumberOfNonLiveVariables, 2097 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 27 InterpolantComputations, 14 PerfectInterpolantSequences, 99/149 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