/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 08:24:40,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 08:24:40,488 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 08:24:40,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 08:24:40,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 08:24:40,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 08:24:40,523 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 08:24:40,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 08:24:40,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 08:24:40,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 08:24:40,528 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 08:24:40,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 08:24:40,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 08:24:40,529 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 08:24:40,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 08:24:40,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 08:24:40,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 08:24:40,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 08:24:40,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 08:24:40,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 08:24:40,531 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 08:24:40,532 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 08:24:40,532 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 08:24:40,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 08:24:40,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 08:24:40,533 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 08:24:40,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 08:24:40,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 08:24:40,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 08:24:40,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 08:24:40,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 08:24:40,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 08:24:40,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 08:24:40,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 08:24:40,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 08:24:40,535 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-26 08:24:40,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 08:24:40,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 08:24:40,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 08:24:40,879 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 08:24:40,879 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 08:24:40,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2023-08-26 08:24:42,053 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 08:24:42,288 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 08:24:42,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2023-08-26 08:24:42,299 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8813291fa/95de6469f9504f3895b5eb8775a7b754/FLAG71f0a6390 [2023-08-26 08:24:42,314 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8813291fa/95de6469f9504f3895b5eb8775a7b754 [2023-08-26 08:24:42,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 08:24:42,320 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 08:24:42,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 08:24:42,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 08:24:42,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 08:24:42,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:24:42" (1/1) ... [2023-08-26 08:24:42,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@84a83bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:24:42, skipping insertion in model container [2023-08-26 08:24:42,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 08:24:42" (1/1) ... [2023-08-26 08:24:42,349 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 08:24:42,549 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 08:24:42,560 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 08:24:42,607 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 08:24:42,625 INFO L206 MainTranslator]: Completed translation [2023-08-26 08:24:42,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:24:42 WrapperNode [2023-08-26 08:24:42,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 08:24:42,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 08:24:42,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 08:24:42,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 08:24:42,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:24:42" (1/1) ... [2023-08-26 08:24:42,653 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:24:42" (1/1) ... [2023-08-26 08:24:42,685 INFO L138 Inliner]: procedures = 25, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 280 [2023-08-26 08:24:42,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 08:24:42,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 08:24:42,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 08:24:42,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 08:24:42,698 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:24:42" (1/1) ... [2023-08-26 08:24:42,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:24:42" (1/1) ... [2023-08-26 08:24:42,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:24:42" (1/1) ... [2023-08-26 08:24:42,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:24:42" (1/1) ... [2023-08-26 08:24:42,717 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:24:42" (1/1) ... [2023-08-26 08:24:42,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:24:42" (1/1) ... [2023-08-26 08:24:42,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:24:42" (1/1) ... [2023-08-26 08:24:42,729 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:24:42" (1/1) ... [2023-08-26 08:24:42,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 08:24:42,733 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 08:24:42,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 08:24:42,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 08:24:42,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:24:42" (1/1) ... [2023-08-26 08:24:42,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 08:24:42,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:24:42,790 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 08:24:42,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 08:24:42,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 08:24:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 08:24:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 08:24:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 08:24:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 08:24:42,823 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 08:24:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 08:24:42,823 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 08:24:42,823 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 08:24:42,824 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 08:24:42,824 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-26 08:24:42,824 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-26 08:24:42,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 08:24:42,824 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-26 08:24:42,824 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-26 08:24:42,824 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-08-26 08:24:42,824 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-08-26 08:24:42,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 08:24:42,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 08:24:42,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 08:24:42,826 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 08:24:42,922 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 08:24:42,924 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 08:24:43,517 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 08:24:43,525 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 08:24:43,526 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-26 08:24:43,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:24:43 BoogieIcfgContainer [2023-08-26 08:24:43,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 08:24:43,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 08:24:43,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 08:24:43,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 08:24:43,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 08:24:42" (1/3) ... [2023-08-26 08:24:43,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ace1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:24:43, skipping insertion in model container [2023-08-26 08:24:43,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 08:24:42" (2/3) ... [2023-08-26 08:24:43,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ace1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 08:24:43, skipping insertion in model container [2023-08-26 08:24:43,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 08:24:43" (3/3) ... [2023-08-26 08:24:43,535 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2023-08-26 08:24:43,549 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 08:24:43,549 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 68 error locations. [2023-08-26 08:24:43,549 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 08:24:43,663 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-08-26 08:24:43,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 460 places, 465 transitions, 978 flow [2023-08-26 08:24:43,876 INFO L124 PetriNetUnfolderBase]: 24/459 cut-off events. [2023-08-26 08:24:43,876 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 08:24:43,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 459 events. 24/459 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 800 event pairs, 0 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 285. Up to 2 conditions per place. [2023-08-26 08:24:43,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 460 places, 465 transitions, 978 flow [2023-08-26 08:24:43,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 437 places, 442 transitions, 920 flow [2023-08-26 08:24:43,902 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 08:24:43,914 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 437 places, 442 transitions, 920 flow [2023-08-26 08:24:43,916 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 437 places, 442 transitions, 920 flow [2023-08-26 08:24:43,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 437 places, 442 transitions, 920 flow [2023-08-26 08:24:43,985 INFO L124 PetriNetUnfolderBase]: 24/442 cut-off events. [2023-08-26 08:24:43,985 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 08:24:43,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 442 events. 24/442 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 798 event pairs, 0 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 270. Up to 2 conditions per place. [2023-08-26 08:24:44,002 INFO L119 LiptonReduction]: Number of co-enabled transitions 28704 [2023-08-26 08:25:04,358 INFO L134 LiptonReduction]: Checked pairs total: 59932 [2023-08-26 08:25:04,359 INFO L136 LiptonReduction]: Total number of compositions: 573 [2023-08-26 08:25:04,369 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 08:25:04,373 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;@6f52a998, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 08:25:04,374 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-08-26 08:25:04,375 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 08:25:04,375 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 08:25:04,375 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 08:25:04,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:25:04,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 08:25:04,376 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2023-08-26 08:25:04,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:25:04,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1716, now seen corresponding path program 1 times [2023-08-26 08:25:04,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:25:04,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909103365] [2023-08-26 08:25:04,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:25:04,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:25:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:25:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:25:04,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:25:04,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909103365] [2023-08-26 08:25:04,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909103365] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:25:04,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:25:04,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 08:25:04,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115006223] [2023-08-26 08:25:04,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:25:04,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 08:25:04,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:25:04,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 08:25:04,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 08:25:04,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 444 out of 1038 [2023-08-26 08:25:04,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 116 transitions, 268 flow. Second operand has 2 states, 2 states have (on average 444.5) internal successors, (889), 2 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:04,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:25:04,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 444 of 1038 [2023-08-26 08:25:04,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:25:05,815 INFO L124 PetriNetUnfolderBase]: 14584/17955 cut-off events. [2023-08-26 08:25:05,816 INFO L125 PetriNetUnfolderBase]: For 741/741 co-relation queries the response was YES. [2023-08-26 08:25:05,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36552 conditions, 17955 events. 14584/17955 cut-off events. For 741/741 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 63862 event pairs, 9480 based on Foata normal form. 0/12851 useless extension candidates. Maximal degree in co-relation 28154. Up to 17498 conditions per place. [2023-08-26 08:25:05,946 INFO L140 encePairwiseOnDemand]: 971/1038 looper letters, 43 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-08-26 08:25:05,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 49 transitions, 220 flow [2023-08-26 08:25:05,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 08:25:05,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 08:25:05,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 998 transitions. [2023-08-26 08:25:05,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48073217726396916 [2023-08-26 08:25:05,966 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 998 transitions. [2023-08-26 08:25:05,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 998 transitions. [2023-08-26 08:25:05,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:25:05,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 998 transitions. [2023-08-26 08:25:05,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 499.0) internal successors, (998), 2 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:05,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 1038.0) internal successors, (3114), 3 states have internal predecessors, (3114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:05,988 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 1038.0) internal successors, (3114), 3 states have internal predecessors, (3114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:05,990 INFO L175 Difference]: Start difference. First operand has 123 places, 116 transitions, 268 flow. Second operand 2 states and 998 transitions. [2023-08-26 08:25:05,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 49 transitions, 220 flow [2023-08-26 08:25:06,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 49 transitions, 196 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-08-26 08:25:06,058 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 110 flow [2023-08-26 08:25:06,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1038, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=110, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2023-08-26 08:25:06,062 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -72 predicate places. [2023-08-26 08:25:06,062 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 110 flow [2023-08-26 08:25:06,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 444.5) internal successors, (889), 2 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:06,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:25:06,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 08:25:06,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 08:25:06,063 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2023-08-26 08:25:06,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:25:06,064 INFO L85 PathProgramCache]: Analyzing trace with hash 53984765, now seen corresponding path program 1 times [2023-08-26 08:25:06,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:25:06,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759454852] [2023-08-26 08:25:06,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:25:06,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:25:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:25:06,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:25:06,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:25:06,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759454852] [2023-08-26 08:25:06,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759454852] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:25:06,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:25:06,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 08:25:06,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162998217] [2023-08-26 08:25:06,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:25:06,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:25:06,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:25:06,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:25:06,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:25:06,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 1038 [2023-08-26 08:25:06,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:06,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:25:06,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 1038 [2023-08-26 08:25:06,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:25:07,252 INFO L124 PetriNetUnfolderBase]: 14625/17550 cut-off events. [2023-08-26 08:25:07,252 INFO L125 PetriNetUnfolderBase]: For 242/242 co-relation queries the response was YES. [2023-08-26 08:25:07,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35472 conditions, 17550 events. 14625/17550 cut-off events. For 242/242 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 57193 event pairs, 6992 based on Foata normal form. 0/12446 useless extension candidates. Maximal degree in co-relation 35469. Up to 17537 conditions per place. [2023-08-26 08:25:07,318 INFO L140 encePairwiseOnDemand]: 1026/1038 looper letters, 54 selfloop transitions, 6 changer transitions 0/60 dead transitions. [2023-08-26 08:25:07,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 257 flow [2023-08-26 08:25:07,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:25:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:25:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1281 transitions. [2023-08-26 08:25:07,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4113680154142582 [2023-08-26 08:25:07,323 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1281 transitions. [2023-08-26 08:25:07,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1281 transitions. [2023-08-26 08:25:07,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:25:07,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1281 transitions. [2023-08-26 08:25:07,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 427.0) internal successors, (1281), 3 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:07,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1038.0) internal successors, (4152), 4 states have internal predecessors, (4152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:07,333 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1038.0) internal successors, (4152), 4 states have internal predecessors, (4152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:07,333 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 110 flow. Second operand 3 states and 1281 transitions. [2023-08-26 08:25:07,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 257 flow [2023-08-26 08:25:07,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 257 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:25:07,335 INFO L231 Difference]: Finished difference. Result has 48 places, 49 transitions, 140 flow [2023-08-26 08:25:07,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1038, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=48, PETRI_TRANSITIONS=49} [2023-08-26 08:25:07,336 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -75 predicate places. [2023-08-26 08:25:07,336 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 140 flow [2023-08-26 08:25:07,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:07,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:25:07,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:25:07,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 08:25:07,337 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2023-08-26 08:25:07,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:25:07,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1045515259, now seen corresponding path program 1 times [2023-08-26 08:25:07,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:25:07,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043480996] [2023-08-26 08:25:07,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:25:07,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:25:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:25:07,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:25:07,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:25:07,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043480996] [2023-08-26 08:25:07,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043480996] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:25:07,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:25:07,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 08:25:07,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270258863] [2023-08-26 08:25:07,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:25:07,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:25:07,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:25:07,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:25:07,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:25:07,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 1038 [2023-08-26 08:25:07,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 49 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 442.3333333333333) internal successors, (1327), 3 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:07,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:25:07,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 1038 [2023-08-26 08:25:07,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:25:09,603 INFO L124 PetriNetUnfolderBase]: 29166/34978 cut-off events. [2023-08-26 08:25:09,604 INFO L125 PetriNetUnfolderBase]: For 7085/7085 co-relation queries the response was YES. [2023-08-26 08:25:09,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80958 conditions, 34978 events. 29166/34978 cut-off events. For 7085/7085 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 127910 event pairs, 8447 based on Foata normal form. 1/24785 useless extension candidates. Maximal degree in co-relation 80954. Up to 19302 conditions per place. [2023-08-26 08:25:09,764 INFO L140 encePairwiseOnDemand]: 1034/1038 looper letters, 77 selfloop transitions, 3 changer transitions 5/85 dead transitions. [2023-08-26 08:25:09,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 85 transitions, 403 flow [2023-08-26 08:25:09,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:25:09,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:25:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1370 transitions. [2023-08-26 08:25:09,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4399486191393706 [2023-08-26 08:25:09,769 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1370 transitions. [2023-08-26 08:25:09,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1370 transitions. [2023-08-26 08:25:09,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:25:09,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1370 transitions. [2023-08-26 08:25:09,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 456.6666666666667) internal successors, (1370), 3 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:09,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1038.0) internal successors, (4152), 4 states have internal predecessors, (4152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:09,779 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1038.0) internal successors, (4152), 4 states have internal predecessors, (4152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:09,779 INFO L175 Difference]: Start difference. First operand has 48 places, 49 transitions, 140 flow. Second operand 3 states and 1370 transitions. [2023-08-26 08:25:09,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 85 transitions, 403 flow [2023-08-26 08:25:09,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 85 transitions, 403 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:25:09,782 INFO L231 Difference]: Finished difference. Result has 51 places, 51 transitions, 159 flow [2023-08-26 08:25:09,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1038, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=51, PETRI_TRANSITIONS=51} [2023-08-26 08:25:09,783 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -72 predicate places. [2023-08-26 08:25:09,783 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 51 transitions, 159 flow [2023-08-26 08:25:09,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 442.3333333333333) internal successors, (1327), 3 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:09,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:25:09,785 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:25:09,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 08:25:09,785 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2023-08-26 08:25:09,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:25:09,785 INFO L85 PathProgramCache]: Analyzing trace with hash -19136328, now seen corresponding path program 1 times [2023-08-26 08:25:09,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:25:09,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948429144] [2023-08-26 08:25:09,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:25:09,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:25:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:25:09,884 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-26 08:25:09,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:25:09,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948429144] [2023-08-26 08:25:09,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948429144] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:25:09,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:25:09,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 08:25:09,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549810484] [2023-08-26 08:25:09,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:25:09,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:25:09,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:25:09,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:25:09,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:25:09,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 1038 [2023-08-26 08:25:09,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 51 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 442.6666666666667) internal successors, (1328), 3 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:09,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:25:09,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 1038 [2023-08-26 08:25:09,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:25:13,127 INFO L124 PetriNetUnfolderBase]: 58270/69872 cut-off events. [2023-08-26 08:25:13,127 INFO L125 PetriNetUnfolderBase]: For 21750/21750 co-relation queries the response was YES. [2023-08-26 08:25:13,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172866 conditions, 69872 events. 58270/69872 cut-off events. For 21750/21750 co-relation queries the response was YES. Maximal size of possible extension queue 1310. Compared 276147 event pairs, 17866 based on Foata normal form. 1/56973 useless extension candidates. Maximal degree in co-relation 172860. Up to 38142 conditions per place. [2023-08-26 08:25:13,406 INFO L140 encePairwiseOnDemand]: 1034/1038 looper letters, 81 selfloop transitions, 3 changer transitions 9/93 dead transitions. [2023-08-26 08:25:13,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 93 transitions, 462 flow [2023-08-26 08:25:13,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:25:13,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:25:13,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1374 transitions. [2023-08-26 08:25:13,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.441233140655106 [2023-08-26 08:25:13,410 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1374 transitions. [2023-08-26 08:25:13,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1374 transitions. [2023-08-26 08:25:13,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:25:13,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1374 transitions. [2023-08-26 08:25:13,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 458.0) internal successors, (1374), 3 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:13,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1038.0) internal successors, (4152), 4 states have internal predecessors, (4152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:13,420 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1038.0) internal successors, (4152), 4 states have internal predecessors, (4152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:13,421 INFO L175 Difference]: Start difference. First operand has 51 places, 51 transitions, 159 flow. Second operand 3 states and 1374 transitions. [2023-08-26 08:25:13,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 93 transitions, 462 flow [2023-08-26 08:25:13,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 93 transitions, 457 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 08:25:13,429 INFO L231 Difference]: Finished difference. Result has 53 places, 53 transitions, 175 flow [2023-08-26 08:25:13,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1038, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=53, PETRI_TRANSITIONS=53} [2023-08-26 08:25:13,430 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -70 predicate places. [2023-08-26 08:25:13,431 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 53 transitions, 175 flow [2023-08-26 08:25:13,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 442.6666666666667) internal successors, (1328), 3 states have internal predecessors, (1328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:13,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:25:13,432 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:25:13,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 08:25:13,432 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2023-08-26 08:25:13,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:25:13,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1542452091, now seen corresponding path program 1 times [2023-08-26 08:25:13,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:25:13,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084181160] [2023-08-26 08:25:13,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:25:13,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:25:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:25:13,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 08:25:13,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:25:13,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084181160] [2023-08-26 08:25:13,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084181160] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:25:13,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:25:13,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 08:25:13,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359845610] [2023-08-26 08:25:13,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:25:13,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:25:13,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:25:13,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:25:13,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:25:13,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 1038 [2023-08-26 08:25:13,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 53 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 443.0) internal successors, (1329), 3 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:13,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:25:13,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 1038 [2023-08-26 08:25:13,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:25:19,907 INFO L124 PetriNetUnfolderBase]: 113173/135455 cut-off events. [2023-08-26 08:25:19,908 INFO L125 PetriNetUnfolderBase]: For 54011/54011 co-relation queries the response was YES. [2023-08-26 08:25:20,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345906 conditions, 135455 events. 113173/135455 cut-off events. For 54011/54011 co-relation queries the response was YES. Maximal size of possible extension queue 2485. Compared 565376 event pairs, 39177 based on Foata normal form. 1/122528 useless extension candidates. Maximal degree in co-relation 345899. Up to 72074 conditions per place. [2023-08-26 08:25:20,421 INFO L140 encePairwiseOnDemand]: 1034/1038 looper letters, 85 selfloop transitions, 3 changer transitions 1/89 dead transitions. [2023-08-26 08:25:20,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 89 transitions, 462 flow [2023-08-26 08:25:20,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:25:20,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:25:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1366 transitions. [2023-08-26 08:25:20,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4386640976236352 [2023-08-26 08:25:20,426 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1366 transitions. [2023-08-26 08:25:20,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1366 transitions. [2023-08-26 08:25:20,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:25:20,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1366 transitions. [2023-08-26 08:25:20,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 455.3333333333333) internal successors, (1366), 3 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:20,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1038.0) internal successors, (4152), 4 states have internal predecessors, (4152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:20,439 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1038.0) internal successors, (4152), 4 states have internal predecessors, (4152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:20,439 INFO L175 Difference]: Start difference. First operand has 53 places, 53 transitions, 175 flow. Second operand 3 states and 1366 transitions. [2023-08-26 08:25:20,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 89 transitions, 462 flow [2023-08-26 08:25:20,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 89 transitions, 457 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 08:25:20,457 INFO L231 Difference]: Finished difference. Result has 55 places, 55 transitions, 191 flow [2023-08-26 08:25:20,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1038, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=55, PETRI_TRANSITIONS=55} [2023-08-26 08:25:20,458 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -68 predicate places. [2023-08-26 08:25:20,458 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 191 flow [2023-08-26 08:25:20,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 443.0) internal successors, (1329), 3 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:20,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:25:20,459 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:25:20,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 08:25:20,460 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2023-08-26 08:25:20,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:25:20,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1829496065, now seen corresponding path program 1 times [2023-08-26 08:25:20,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:25:20,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544467696] [2023-08-26 08:25:20,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:25:20,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:25:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:25:20,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 08:25:20,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:25:20,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544467696] [2023-08-26 08:25:20,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544467696] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:25:20,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912494031] [2023-08-26 08:25:20,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:25:20,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:25:20,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:25:20,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 08:25:20,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 08:25:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:25:20,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 08:25:20,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:25:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 08:25:20,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:25:20,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 08:25:20,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912494031] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:25:20,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:25:20,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-26 08:25:20,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901757934] [2023-08-26 08:25:20,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:25:20,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:25:20,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:25:20,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:25:20,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:25:20,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 1038 [2023-08-26 08:25:20,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 426.25) internal successors, (1705), 4 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:20,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:25:20,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 1038 [2023-08-26 08:25:20,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:25:30,955 INFO L124 PetriNetUnfolderBase]: 166363/199779 cut-off events. [2023-08-26 08:25:30,955 INFO L125 PetriNetUnfolderBase]: For 88678/88678 co-relation queries the response was YES. [2023-08-26 08:25:31,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531908 conditions, 199779 events. 166363/199779 cut-off events. For 88678/88678 co-relation queries the response was YES. Maximal size of possible extension queue 3699. Compared 908305 event pairs, 36501 based on Foata normal form. 3391/203170 useless extension candidates. Maximal degree in co-relation 531900. Up to 74496 conditions per place. [2023-08-26 08:25:31,642 INFO L140 encePairwiseOnDemand]: 1032/1038 looper letters, 142 selfloop transitions, 6 changer transitions 19/167 dead transitions. [2023-08-26 08:25:31,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 167 transitions, 869 flow [2023-08-26 08:25:31,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 08:25:31,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 08:25:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2228 transitions. [2023-08-26 08:25:31,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42928709055876685 [2023-08-26 08:25:31,648 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2228 transitions. [2023-08-26 08:25:31,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2228 transitions. [2023-08-26 08:25:31,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:25:31,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2228 transitions. [2023-08-26 08:25:31,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 445.6) internal successors, (2228), 5 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:31,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1038.0) internal successors, (6228), 6 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:31,663 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1038.0) internal successors, (6228), 6 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:31,663 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 191 flow. Second operand 5 states and 2228 transitions. [2023-08-26 08:25:31,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 167 transitions, 869 flow [2023-08-26 08:25:31,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 167 transitions, 860 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 08:25:31,700 INFO L231 Difference]: Finished difference. Result has 60 places, 58 transitions, 225 flow [2023-08-26 08:25:31,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1038, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=60, PETRI_TRANSITIONS=58} [2023-08-26 08:25:31,701 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -63 predicate places. [2023-08-26 08:25:31,701 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 58 transitions, 225 flow [2023-08-26 08:25:31,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 426.25) internal successors, (1705), 4 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:31,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:25:31,702 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:25:31,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 08:25:31,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-26 08:25:31,909 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2023-08-26 08:25:31,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:25:31,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2025379827, now seen corresponding path program 1 times [2023-08-26 08:25:31,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:25:31,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110779464] [2023-08-26 08:25:31,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:25:31,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:25:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:25:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 08:25:32,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:25:32,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110779464] [2023-08-26 08:25:32,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110779464] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:25:32,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:25:32,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:25:32,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517607147] [2023-08-26 08:25:32,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:25:32,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:25:32,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:25:32,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:25:32,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:25:32,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 1038 [2023-08-26 08:25:32,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 58 transitions, 225 flow. Second operand has 4 states, 4 states have (on average 426.25) internal successors, (1705), 4 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:32,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:25:32,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 1038 [2023-08-26 08:25:32,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:25:42,588 INFO L124 PetriNetUnfolderBase]: 164801/198217 cut-off events. [2023-08-26 08:25:42,589 INFO L125 PetriNetUnfolderBase]: For 142343/142343 co-relation queries the response was YES. [2023-08-26 08:25:42,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556806 conditions, 198217 events. 164801/198217 cut-off events. For 142343/142343 co-relation queries the response was YES. Maximal size of possible extension queue 3697. Compared 914366 event pairs, 11707 based on Foata normal form. 1562/199779 useless extension candidates. Maximal degree in co-relation 556796. Up to 88127 conditions per place. [2023-08-26 08:25:43,264 INFO L140 encePairwiseOnDemand]: 1033/1038 looper letters, 113 selfloop transitions, 4 changer transitions 46/163 dead transitions. [2023-08-26 08:25:43,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 163 transitions, 889 flow [2023-08-26 08:25:43,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 08:25:43,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 08:25:43,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2218 transitions. [2023-08-26 08:25:43,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4273603082851638 [2023-08-26 08:25:43,269 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2218 transitions. [2023-08-26 08:25:43,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2218 transitions. [2023-08-26 08:25:43,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:25:43,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2218 transitions. [2023-08-26 08:25:43,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 443.6) internal successors, (2218), 5 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:43,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1038.0) internal successors, (6228), 6 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:43,282 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1038.0) internal successors, (6228), 6 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:43,282 INFO L175 Difference]: Start difference. First operand has 60 places, 58 transitions, 225 flow. Second operand 5 states and 2218 transitions. [2023-08-26 08:25:43,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 163 transitions, 889 flow [2023-08-26 08:25:45,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 163 transitions, 883 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 08:25:45,714 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 233 flow [2023-08-26 08:25:45,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1038, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=233, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2023-08-26 08:25:45,714 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -59 predicate places. [2023-08-26 08:25:45,715 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 233 flow [2023-08-26 08:25:45,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 426.25) internal successors, (1705), 4 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:45,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:25:45,716 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:25:45,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 08:25:45,716 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2023-08-26 08:25:45,717 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:25:45,717 INFO L85 PathProgramCache]: Analyzing trace with hash 239123391, now seen corresponding path program 2 times [2023-08-26 08:25:45,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:25:45,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194409110] [2023-08-26 08:25:45,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:25:45,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:25:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:25:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 08:25:45,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:25:45,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194409110] [2023-08-26 08:25:45,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194409110] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:25:45,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867058797] [2023-08-26 08:25:45,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 08:25:45,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:25:45,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:25:45,831 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 08:25:45,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 08:25:46,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 08:25:46,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 08:25:46,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 08:25:46,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:25:46,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 08:25:46,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:25:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 08:25:46,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867058797] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:25:46,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:25:46,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 3 [2023-08-26 08:25:46,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864755255] [2023-08-26 08:25:46,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:25:46,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:25:46,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:25:46,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:25:46,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:25:46,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 1038 [2023-08-26 08:25:46,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 432.75) internal successors, (1731), 4 states have internal predecessors, (1731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:46,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:25:46,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 1038 [2023-08-26 08:25:46,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:25:56,103 INFO L124 PetriNetUnfolderBase]: 163107/195341 cut-off events. [2023-08-26 08:25:56,103 INFO L125 PetriNetUnfolderBase]: For 175075/175075 co-relation queries the response was YES. [2023-08-26 08:25:56,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576804 conditions, 195341 events. 163107/195341 cut-off events. For 175075/175075 co-relation queries the response was YES. Maximal size of possible extension queue 3664. Compared 880123 event pairs, 35573 based on Foata normal form. 3535/198876 useless extension candidates. Maximal degree in co-relation 576792. Up to 73012 conditions per place. [2023-08-26 08:25:57,172 INFO L140 encePairwiseOnDemand]: 1032/1038 looper letters, 154 selfloop transitions, 6 changer transitions 11/171 dead transitions. [2023-08-26 08:25:57,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 171 transitions, 1010 flow [2023-08-26 08:25:57,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 08:25:57,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 08:25:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2220 transitions. [2023-08-26 08:25:57,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4277456647398844 [2023-08-26 08:25:57,177 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2220 transitions. [2023-08-26 08:25:57,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2220 transitions. [2023-08-26 08:25:57,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:25:57,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2220 transitions. [2023-08-26 08:25:57,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 444.0) internal successors, (2220), 5 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:57,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1038.0) internal successors, (6228), 6 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:57,188 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1038.0) internal successors, (6228), 6 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:57,188 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 233 flow. Second operand 5 states and 2220 transitions. [2023-08-26 08:25:57,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 171 transitions, 1010 flow [2023-08-26 08:25:57,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 171 transitions, 997 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 08:25:57,252 INFO L231 Difference]: Finished difference. Result has 68 places, 61 transitions, 263 flow [2023-08-26 08:25:57,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1038, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=68, PETRI_TRANSITIONS=61} [2023-08-26 08:25:57,253 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -55 predicate places. [2023-08-26 08:25:57,253 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 61 transitions, 263 flow [2023-08-26 08:25:57,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 432.75) internal successors, (1731), 4 states have internal predecessors, (1731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:57,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:25:57,254 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:25:57,260 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-26 08:25:57,464 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,SelfDestructingSolverStorable7 [2023-08-26 08:25:57,465 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2023-08-26 08:25:57,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:25:57,465 INFO L85 PathProgramCache]: Analyzing trace with hash 684197033, now seen corresponding path program 1 times [2023-08-26 08:25:57,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:25:57,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330279197] [2023-08-26 08:25:57,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:25:57,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:25:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:25:57,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 08:25:57,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:25:57,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330279197] [2023-08-26 08:25:57,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330279197] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:25:57,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615701578] [2023-08-26 08:25:57,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:25:57,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:25:57,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:25:57,626 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 08:25:57,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 08:25:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:25:57,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 08:25:57,814 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:25:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 08:25:57,869 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:25:57,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 08:25:57,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615701578] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:25:57,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:25:57,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-26 08:25:57,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974260378] [2023-08-26 08:25:57,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:25:57,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:25:57,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:25:57,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:25:57,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:25:57,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 1038 [2023-08-26 08:25:57,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 263 flow. Second operand has 4 states, 4 states have (on average 426.25) internal successors, (1705), 4 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:25:57,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:25:57,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 1038 [2023-08-26 08:25:57,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:26:11,730 INFO L124 PetriNetUnfolderBase]: 205539/245957 cut-off events. [2023-08-26 08:26:11,730 INFO L125 PetriNetUnfolderBase]: For 269546/269546 co-relation queries the response was YES. [2023-08-26 08:26:12,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781348 conditions, 245957 events. 205539/245957 cut-off events. For 269546/269546 co-relation queries the response was YES. Maximal size of possible extension queue 4448. Compared 1136359 event pairs, 20861 based on Foata normal form. 4092/250049 useless extension candidates. Maximal degree in co-relation 781333. Up to 168410 conditions per place. [2023-08-26 08:26:12,765 INFO L140 encePairwiseOnDemand]: 1033/1038 looper letters, 150 selfloop transitions, 6 changer transitions 0/156 dead transitions. [2023-08-26 08:26:12,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 156 transitions, 955 flow [2023-08-26 08:26:12,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 08:26:12,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 08:26:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2201 transitions. [2023-08-26 08:26:12,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42408477842003856 [2023-08-26 08:26:12,773 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2201 transitions. [2023-08-26 08:26:12,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2201 transitions. [2023-08-26 08:26:12,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:26:12,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2201 transitions. [2023-08-26 08:26:12,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 440.2) internal successors, (2201), 5 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:26:12,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1038.0) internal successors, (6228), 6 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:26:12,784 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1038.0) internal successors, (6228), 6 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:26:12,784 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 263 flow. Second operand 5 states and 2201 transitions. [2023-08-26 08:26:12,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 156 transitions, 955 flow [2023-08-26 08:26:16,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 156 transitions, 938 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-26 08:26:16,584 INFO L231 Difference]: Finished difference. Result has 73 places, 64 transitions, 299 flow [2023-08-26 08:26:16,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1038, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=73, PETRI_TRANSITIONS=64} [2023-08-26 08:26:16,585 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -50 predicate places. [2023-08-26 08:26:16,585 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 64 transitions, 299 flow [2023-08-26 08:26:16,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 426.25) internal successors, (1705), 4 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:26:16,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:26:16,586 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:26:16,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 08:26:16,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:26:16,800 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2023-08-26 08:26:16,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:26:16,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1330360916, now seen corresponding path program 1 times [2023-08-26 08:26:16,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:26:16,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915568974] [2023-08-26 08:26:16,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:26:16,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:26:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:26:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-26 08:26:16,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:26:16,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915568974] [2023-08-26 08:26:16,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915568974] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:26:16,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:26:16,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:26:16,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550474117] [2023-08-26 08:26:16,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:26:16,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:26:16,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:26:16,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:26:16,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:26:16,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 1038 [2023-08-26 08:26:16,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 64 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:26:16,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:26:16,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 1038 [2023-08-26 08:26:16,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:26:30,620 INFO L124 PetriNetUnfolderBase]: 204037/244455 cut-off events. [2023-08-26 08:26:30,620 INFO L125 PetriNetUnfolderBase]: For 372934/372934 co-relation queries the response was YES. [2023-08-26 08:26:31,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813009 conditions, 244455 events. 204037/244455 cut-off events. For 372934/372934 co-relation queries the response was YES. Maximal size of possible extension queue 4449. Compared 1134530 event pairs, 19579 based on Foata normal form. 1502/245957 useless extension candidates. Maximal degree in co-relation 812991. Up to 117011 conditions per place. [2023-08-26 08:26:31,713 INFO L140 encePairwiseOnDemand]: 1033/1038 looper letters, 131 selfloop transitions, 4 changer transitions 48/183 dead transitions. [2023-08-26 08:26:31,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 183 transitions, 1220 flow [2023-08-26 08:26:31,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 08:26:31,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 08:26:31,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2214 transitions. [2023-08-26 08:26:31,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42658959537572255 [2023-08-26 08:26:31,718 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2214 transitions. [2023-08-26 08:26:31,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2214 transitions. [2023-08-26 08:26:31,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:26:31,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2214 transitions. [2023-08-26 08:26:31,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 442.8) internal successors, (2214), 5 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:26:31,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1038.0) internal successors, (6228), 6 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:26:31,728 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1038.0) internal successors, (6228), 6 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:26:31,729 INFO L175 Difference]: Start difference. First operand has 73 places, 64 transitions, 299 flow. Second operand 5 states and 2214 transitions. [2023-08-26 08:26:31,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 183 transitions, 1220 flow [2023-08-26 08:26:41,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 183 transitions, 1187 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-08-26 08:26:41,319 INFO L231 Difference]: Finished difference. Result has 77 places, 64 transitions, 303 flow [2023-08-26 08:26:41,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1038, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=303, PETRI_PLACES=77, PETRI_TRANSITIONS=64} [2023-08-26 08:26:41,320 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -46 predicate places. [2023-08-26 08:26:41,320 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 64 transitions, 303 flow [2023-08-26 08:26:41,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 427.0) internal successors, (1708), 4 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:26:41,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:26:41,321 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:26:41,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 08:26:41,321 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2023-08-26 08:26:41,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:26:41,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1404188252, now seen corresponding path program 2 times [2023-08-26 08:26:41,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:26:41,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051539124] [2023-08-26 08:26:41,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:26:41,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:26:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:26:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-26 08:26:41,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:26:41,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051539124] [2023-08-26 08:26:41,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051539124] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:26:41,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153389985] [2023-08-26 08:26:41,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 08:26:41,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:26:41,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:26:41,461 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 08:26:41,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 08:26:41,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 08:26:41,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 08:26:41,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 08:26:41,717 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:26:41,829 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-26 08:26:41,830 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:26:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-26 08:26:41,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153389985] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:26:41,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:26:41,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 3 [2023-08-26 08:26:41,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498821870] [2023-08-26 08:26:41,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:26:41,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:26:41,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:26:41,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:26:41,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:26:41,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 1038 [2023-08-26 08:26:41,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 64 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 431.0) internal successors, (1724), 4 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:26:41,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:26:41,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 1038 [2023-08-26 08:26:41,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:26:56,781 INFO L124 PetriNetUnfolderBase]: 201354/240467 cut-off events. [2023-08-26 08:26:56,781 INFO L125 PetriNetUnfolderBase]: For 395626/395626 co-relation queries the response was YES. [2023-08-26 08:26:57,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825450 conditions, 240467 events. 201354/240467 cut-off events. For 395626/395626 co-relation queries the response was YES. Maximal size of possible extension queue 4353. Compared 1054616 event pairs, 48046 based on Foata normal form. 3573/244040 useless extension candidates. Maximal degree in co-relation 825430. Up to 82902 conditions per place. [2023-08-26 08:26:58,293 INFO L140 encePairwiseOnDemand]: 1032/1038 looper letters, 178 selfloop transitions, 6 changer transitions 3/187 dead transitions. [2023-08-26 08:26:58,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 187 transitions, 1296 flow [2023-08-26 08:26:58,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 08:26:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 08:26:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2212 transitions. [2023-08-26 08:26:58,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42620423892100195 [2023-08-26 08:26:58,297 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2212 transitions. [2023-08-26 08:26:58,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2212 transitions. [2023-08-26 08:26:58,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:26:58,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2212 transitions. [2023-08-26 08:26:58,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 442.4) internal successors, (2212), 5 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:26:58,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1038.0) internal successors, (6228), 6 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:26:58,306 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1038.0) internal successors, (6228), 6 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:26:58,306 INFO L175 Difference]: Start difference. First operand has 77 places, 64 transitions, 303 flow. Second operand 5 states and 2212 transitions. [2023-08-26 08:26:58,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 187 transitions, 1296 flow [2023-08-26 08:26:58,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 187 transitions, 1283 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 08:26:58,631 INFO L231 Difference]: Finished difference. Result has 81 places, 67 transitions, 333 flow [2023-08-26 08:26:58,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1038, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=333, PETRI_PLACES=81, PETRI_TRANSITIONS=67} [2023-08-26 08:26:58,632 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -42 predicate places. [2023-08-26 08:26:58,632 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 67 transitions, 333 flow [2023-08-26 08:26:58,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 431.0) internal successors, (1724), 4 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:26:58,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:26:58,633 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:26:58,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 08:26:58,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:26:58,841 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2023-08-26 08:26:58,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:26:58,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1882367778, now seen corresponding path program 1 times [2023-08-26 08:26:58,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:26:58,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930212046] [2023-08-26 08:26:58,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:26:58,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:26:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:26:58,983 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 08:26:58,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:26:58,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930212046] [2023-08-26 08:26:58,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930212046] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:26:58,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976324255] [2023-08-26 08:26:58,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:26:58,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:26:58,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:26:58,985 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 08:26:58,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 08:26:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:26:59,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 08:26:59,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:26:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 08:26:59,246 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:26:59,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 08:26:59,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976324255] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:26:59,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:26:59,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-26 08:26:59,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520987317] [2023-08-26 08:26:59,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:26:59,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:26:59,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:26:59,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:26:59,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:26:59,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 1038 [2023-08-26 08:26:59,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 67 transitions, 333 flow. Second operand has 4 states, 4 states have (on average 426.5) internal successors, (1706), 4 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:26:59,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:26:59,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 1038 [2023-08-26 08:26:59,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:27:19,214 INFO L124 PetriNetUnfolderBase]: 264384/315641 cut-off events. [2023-08-26 08:27:19,214 INFO L125 PetriNetUnfolderBase]: For 545786/545786 co-relation queries the response was YES. [2023-08-26 08:27:20,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141928 conditions, 315641 events. 264384/315641 cut-off events. For 545786/545786 co-relation queries the response was YES. Maximal size of possible extension queue 5336. Compared 1474550 event pairs, 30827 based on Foata normal form. 6072/321713 useless extension candidates. Maximal degree in co-relation 1141905. Up to 199950 conditions per place. [2023-08-26 08:27:20,950 INFO L140 encePairwiseOnDemand]: 1033/1038 looper letters, 174 selfloop transitions, 6 changer transitions 0/180 dead transitions. [2023-08-26 08:27:20,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 180 transitions, 1277 flow [2023-08-26 08:27:20,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 08:27:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 08:27:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2201 transitions. [2023-08-26 08:27:20,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42408477842003856 [2023-08-26 08:27:20,954 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2201 transitions. [2023-08-26 08:27:20,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2201 transitions. [2023-08-26 08:27:20,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:27:20,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2201 transitions. [2023-08-26 08:27:20,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 440.2) internal successors, (2201), 5 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:27:20,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1038.0) internal successors, (6228), 6 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:27:20,963 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1038.0) internal successors, (6228), 6 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:27:20,963 INFO L175 Difference]: Start difference. First operand has 81 places, 67 transitions, 333 flow. Second operand 5 states and 2201 transitions. [2023-08-26 08:27:20,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 180 transitions, 1277 flow [2023-08-26 08:27:39,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 180 transitions, 1260 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-26 08:27:39,371 INFO L231 Difference]: Finished difference. Result has 86 places, 70 transitions, 369 flow [2023-08-26 08:27:39,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1038, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=86, PETRI_TRANSITIONS=70} [2023-08-26 08:27:39,372 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -37 predicate places. [2023-08-26 08:27:39,372 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 70 transitions, 369 flow [2023-08-26 08:27:39,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 426.5) internal successors, (1706), 4 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:27:39,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:27:39,373 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:27:39,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 08:27:39,577 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,SelfDestructingSolverStorable11 [2023-08-26 08:27:39,577 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2023-08-26 08:27:39,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:27:39,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1220034469, now seen corresponding path program 1 times [2023-08-26 08:27:39,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:27:39,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510614166] [2023-08-26 08:27:39,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:27:39,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:27:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:27:39,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-26 08:27:39,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:27:39,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510614166] [2023-08-26 08:27:39,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510614166] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:27:39,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:27:39,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 08:27:39,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67935979] [2023-08-26 08:27:39,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:27:39,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:27:39,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:27:39,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:27:39,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:27:39,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 1038 [2023-08-26 08:27:39,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 70 transitions, 369 flow. Second operand has 4 states, 4 states have (on average 427.25) internal successors, (1709), 4 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:27:39,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:27:39,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 1038 [2023-08-26 08:27:39,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:27:59,683 INFO L124 PetriNetUnfolderBase]: 262820/314077 cut-off events. [2023-08-26 08:27:59,683 INFO L125 PetriNetUnfolderBase]: For 708350/708350 co-relation queries the response was YES. [2023-08-26 08:28:00,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1190937 conditions, 314077 events. 262820/314077 cut-off events. For 708350/708350 co-relation queries the response was YES. Maximal size of possible extension queue 5336. Compared 1425716 event pairs, 31219 based on Foata normal form. 1564/315641 useless extension candidates. Maximal degree in co-relation 1190911. Up to 149067 conditions per place. [2023-08-26 08:28:01,431 INFO L140 encePairwiseOnDemand]: 1033/1038 looper letters, 149 selfloop transitions, 4 changer transitions 50/203 dead transitions. [2023-08-26 08:28:01,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 203 transitions, 1524 flow [2023-08-26 08:28:01,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 08:28:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 08:28:01,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2210 transitions. [2023-08-26 08:28:01,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4258188824662813 [2023-08-26 08:28:01,435 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2210 transitions. [2023-08-26 08:28:01,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2210 transitions. [2023-08-26 08:28:01,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:28:01,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2210 transitions. [2023-08-26 08:28:01,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 442.0) internal successors, (2210), 5 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:28:01,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1038.0) internal successors, (6228), 6 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:28:01,441 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1038.0) internal successors, (6228), 6 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:28:01,441 INFO L175 Difference]: Start difference. First operand has 86 places, 70 transitions, 369 flow. Second operand 5 states and 2210 transitions. [2023-08-26 08:28:01,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 203 transitions, 1524 flow [2023-08-26 08:28:24,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 203 transitions, 1491 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-08-26 08:28:24,183 INFO L231 Difference]: Finished difference. Result has 90 places, 70 transitions, 373 flow [2023-08-26 08:28:24,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1038, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=373, PETRI_PLACES=90, PETRI_TRANSITIONS=70} [2023-08-26 08:28:24,184 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -33 predicate places. [2023-08-26 08:28:24,184 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 70 transitions, 373 flow [2023-08-26 08:28:24,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 427.25) internal successors, (1709), 4 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:28:24,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:28:24,185 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:28:24,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 08:28:24,185 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2023-08-26 08:28:24,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:28:24,185 INFO L85 PathProgramCache]: Analyzing trace with hash -208766743, now seen corresponding path program 2 times [2023-08-26 08:28:24,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:28:24,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649872045] [2023-08-26 08:28:24,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:28:24,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:28:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:28:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-26 08:28:24,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:28:24,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649872045] [2023-08-26 08:28:24,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649872045] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:28:24,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464603732] [2023-08-26 08:28:24,289 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 08:28:24,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:28:24,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:28:24,290 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 08:28:24,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 08:28:24,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 08:28:24,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 08:28:24,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 08:28:24,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:28:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-26 08:28:24,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:28:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-26 08:28:24,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464603732] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:28:24,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:28:24,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 3 [2023-08-26 08:28:24,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402847882] [2023-08-26 08:28:24,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:28:24,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 08:28:24,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:28:24,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 08:28:24,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 08:28:24,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 1038 [2023-08-26 08:28:24,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 70 transitions, 373 flow. Second operand has 4 states, 4 states have (on average 428.25) internal successors, (1713), 4 states have internal predecessors, (1713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:28:24,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:28:24,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 1038 [2023-08-26 08:28:24,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:28:46,626 INFO L124 PetriNetUnfolderBase]: 246096/292969 cut-off events. [2023-08-26 08:28:46,626 INFO L125 PetriNetUnfolderBase]: For 621682/621682 co-relation queries the response was YES. [2023-08-26 08:28:47,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125974 conditions, 292969 events. 246096/292969 cut-off events. For 621682/621682 co-relation queries the response was YES. Maximal size of possible extension queue 4474. Compared 1281812 event pairs, 34345 based on Foata normal form. 4686/297655 useless extension candidates. Maximal degree in co-relation 1125946. Up to 180398 conditions per place. [2023-08-26 08:28:48,719 INFO L140 encePairwiseOnDemand]: 1033/1038 looper letters, 186 selfloop transitions, 6 changer transitions 0/192 dead transitions. [2023-08-26 08:28:48,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 192 transitions, 1446 flow [2023-08-26 08:28:48,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 08:28:48,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 08:28:48,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2201 transitions. [2023-08-26 08:28:48,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42408477842003856 [2023-08-26 08:28:48,723 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2201 transitions. [2023-08-26 08:28:48,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2201 transitions. [2023-08-26 08:28:48,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:28:48,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2201 transitions. [2023-08-26 08:28:48,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 440.2) internal successors, (2201), 5 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:28:48,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1038.0) internal successors, (6228), 6 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:28:48,729 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1038.0) internal successors, (6228), 6 states have internal predecessors, (6228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:28:48,729 INFO L175 Difference]: Start difference. First operand has 90 places, 70 transitions, 373 flow. Second operand 5 states and 2201 transitions. [2023-08-26 08:28:48,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 192 transitions, 1446 flow [2023-08-26 08:29:05,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 192 transitions, 1439 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 08:29:05,380 INFO L231 Difference]: Finished difference. Result has 94 places, 73 transitions, 407 flow [2023-08-26 08:29:05,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1038, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=407, PETRI_PLACES=94, PETRI_TRANSITIONS=73} [2023-08-26 08:29:05,380 INFO L281 CegarLoopForPetriNet]: 123 programPoint places, -29 predicate places. [2023-08-26 08:29:05,380 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 73 transitions, 407 flow [2023-08-26 08:29:05,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 428.25) internal successors, (1713), 4 states have internal predecessors, (1713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:29:05,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:29:05,381 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:29:05,386 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-26 08:29:05,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:29:05,585 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2023-08-26 08:29:05,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:29:05,585 INFO L85 PathProgramCache]: Analyzing trace with hash -381591057, now seen corresponding path program 1 times [2023-08-26 08:29:05,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:29:05,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175775958] [2023-08-26 08:29:05,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:29:05,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:29:05,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:29:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-26 08:29:06,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:29:06,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175775958] [2023-08-26 08:29:06,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175775958] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:29:06,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326275208] [2023-08-26 08:29:06,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:29:06,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:29:06,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:29:06,213 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 08:29:06,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 08:30:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:30:09,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-26 08:30:09,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:30:21,305 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-26 08:30:21,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:30:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-26 08:30:43,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326275208] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:30:43,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:30:43,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 15 [2023-08-26 08:30:43,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145808347] [2023-08-26 08:30:43,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:30:43,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-26 08:30:43,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:30:43,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-26 08:30:43,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=209, Unknown=12, NotChecked=0, Total=272 [2023-08-26 08:30:43,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 1038 [2023-08-26 08:30:43,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 73 transitions, 407 flow. Second operand has 17 states, 17 states have (on average 416.3529411764706) internal successors, (7078), 17 states have internal predecessors, (7078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:30:43,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:30:43,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 1038 [2023-08-26 08:30:43,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:31:12,631 WARN L234 SmtUtils]: Spent 27.07s on a formula simplification. DAG size of input: 48 DAG size of output: 36 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 08:31:17,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:31:28,041 WARN L234 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 08:31:30,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:31:52,731 WARN L234 SmtUtils]: Spent 18.21s on a formula simplification. DAG size of input: 39 DAG size of output: 19 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 08:32:20,034 WARN L234 SmtUtils]: Spent 14.08s on a formula simplification. DAG size of input: 49 DAG size of output: 31 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 08:32:22,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:32:24,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:32:26,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:32:28,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 08:32:30,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:32:32,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:32:34,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:32:37,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:32:39,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:32:41,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:32:42,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:32:44,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:32:57,178 WARN L234 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 08:34:04,824 WARN L234 SmtUtils]: Spent 1.02m on a formula simplification. DAG size of input: 62 DAG size of output: 61 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 08:34:06,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:34:08,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:34:12,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:34:15,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:34:17,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:34:19,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:34:21,497 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_~x6~0 2147483648))) (let ((.cse2 (* .cse4 2)) (.cse1 (mod c_~x5~0 4294967296)) (.cse8 (* 2 c_~x4~0)) (.cse9 (mod (* 4294967295 (div (* (- 1) c_~x5~0) 2)) 4294967296)) (.cse0 (mod c_~n~0 4294967296))) (and (<= .cse0 .cse1) (or (< .cse2 .cse0) (= .cse2 .cse1)) (let ((.cse5 (mod c_~x5~0 2147483648))) (let ((.cse3 (+ (mod c_~x3~0 4294967296) 1)) (.cse7 (* 2 .cse5)) (.cse6 (+ .cse1 1))) (or (< .cse2 .cse3) (= .cse4 .cse5) (< .cse2 .cse6) (< .cse7 .cse3) (< .cse7 .cse6)))) (<= c_~x3~0 (+ .cse8 (* (div (+ c_~x3~0 (* (- 2) c_~x4~0)) 4294967296) 4294967296))) (= (mod c_~x5~0 2) 0) (<= (+ c_~x3~0 (* 4294967296 (div c_~n~0 4294967296))) (+ (* (div (+ (* (- 4) c_~x4~0) (* 4294967296 (div c_~x3~0 4294967296)) (- 2) c_~x3~0 (* 2 c_~n~0)) 8589934592) 4294967296) .cse8)) (= (mod c_~x6~0 4294967296) .cse9) (< .cse9 .cse0)))) is different from false [2023-08-26 08:34:23,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:34:25,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:34:27,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:34:53,564 WARN L234 SmtUtils]: Spent 12.02s on a formula simplification. DAG size of input: 40 DAG size of output: 21 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 08:34:58,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:00,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:02,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:04,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:06,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:11,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:15,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:17,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:18,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:21,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:23,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:25,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:34,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:37,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:39,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:41,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:43,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:45,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:47,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:49,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:52,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:54,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:56,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:35:58,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:36:00,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:36:02,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:36:06,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:36:08,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:36:10,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:36:12,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:36:15,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:36:17,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:36:19,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:36:21,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:36:23,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:36:38,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:36:40,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:36:42,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:37:07,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:37:22,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:37:24,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:37:26,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:37:28,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 08:37:30,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 08:37:32,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 08:37:34,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:37:36,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:37:38,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:37:40,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:37:42,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:37:44,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:37:46,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:37:49,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:37:51,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:37:52,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:37:54,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:37:57,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:37:59,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 08:38:01,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-08-26 08:38:02,044 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 08:38:02,044 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 08:38:03,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-26 08:38:03,246 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-26 08:38:03,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-26 08:38:03,252 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr37ASSERT_VIOLATIONASSERT (103 of 104 remaining) [2023-08-26 08:38:03,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 08:38:03,253 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-26 08:38:03,254 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (102 of 104 remaining) [2023-08-26 08:38:03,254 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (101 of 104 remaining) [2023-08-26 08:38:03,254 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (100 of 104 remaining) [2023-08-26 08:38:03,254 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (99 of 104 remaining) [2023-08-26 08:38:03,254 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (98 of 104 remaining) [2023-08-26 08:38:03,254 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (97 of 104 remaining) [2023-08-26 08:38:03,254 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (96 of 104 remaining) [2023-08-26 08:38:03,254 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (95 of 104 remaining) [2023-08-26 08:38:03,254 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (94 of 104 remaining) [2023-08-26 08:38:03,254 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (93 of 104 remaining) [2023-08-26 08:38:03,254 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (92 of 104 remaining) [2023-08-26 08:38:03,254 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (91 of 104 remaining) [2023-08-26 08:38:03,255 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (90 of 104 remaining) [2023-08-26 08:38:03,255 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (89 of 104 remaining) [2023-08-26 08:38:03,255 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (88 of 104 remaining) [2023-08-26 08:38:03,255 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (87 of 104 remaining) [2023-08-26 08:38:03,255 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (86 of 104 remaining) [2023-08-26 08:38:03,255 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (85 of 104 remaining) [2023-08-26 08:38:03,255 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (84 of 104 remaining) [2023-08-26 08:38:03,255 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (83 of 104 remaining) [2023-08-26 08:38:03,255 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (82 of 104 remaining) [2023-08-26 08:38:03,255 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (81 of 104 remaining) [2023-08-26 08:38:03,255 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (80 of 104 remaining) [2023-08-26 08:38:03,255 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (79 of 104 remaining) [2023-08-26 08:38:03,255 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (78 of 104 remaining) [2023-08-26 08:38:03,255 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (77 of 104 remaining) [2023-08-26 08:38:03,256 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (76 of 104 remaining) [2023-08-26 08:38:03,256 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (75 of 104 remaining) [2023-08-26 08:38:03,256 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (74 of 104 remaining) [2023-08-26 08:38:03,256 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (73 of 104 remaining) [2023-08-26 08:38:03,256 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (72 of 104 remaining) [2023-08-26 08:38:03,256 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (71 of 104 remaining) [2023-08-26 08:38:03,256 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (70 of 104 remaining) [2023-08-26 08:38:03,256 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (69 of 104 remaining) [2023-08-26 08:38:03,256 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (68 of 104 remaining) [2023-08-26 08:38:03,256 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (67 of 104 remaining) [2023-08-26 08:38:03,256 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (66 of 104 remaining) [2023-08-26 08:38:03,256 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (65 of 104 remaining) [2023-08-26 08:38:03,256 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (64 of 104 remaining) [2023-08-26 08:38:03,257 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (63 of 104 remaining) [2023-08-26 08:38:03,257 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (62 of 104 remaining) [2023-08-26 08:38:03,257 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (61 of 104 remaining) [2023-08-26 08:38:03,257 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (60 of 104 remaining) [2023-08-26 08:38:03,257 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (59 of 104 remaining) [2023-08-26 08:38:03,257 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (58 of 104 remaining) [2023-08-26 08:38:03,257 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (57 of 104 remaining) [2023-08-26 08:38:03,257 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (56 of 104 remaining) [2023-08-26 08:38:03,257 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (55 of 104 remaining) [2023-08-26 08:38:03,258 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (54 of 104 remaining) [2023-08-26 08:38:03,258 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (53 of 104 remaining) [2023-08-26 08:38:03,258 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (52 of 104 remaining) [2023-08-26 08:38:03,258 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (51 of 104 remaining) [2023-08-26 08:38:03,258 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 104 remaining) [2023-08-26 08:38:03,258 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 104 remaining) [2023-08-26 08:38:03,258 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 104 remaining) [2023-08-26 08:38:03,258 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 104 remaining) [2023-08-26 08:38:03,258 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 104 remaining) [2023-08-26 08:38:03,258 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 104 remaining) [2023-08-26 08:38:03,259 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err0ASSERT_VIOLATIONDATA_RACE (44 of 104 remaining) [2023-08-26 08:38:03,259 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err1ASSERT_VIOLATIONDATA_RACE (43 of 104 remaining) [2023-08-26 08:38:03,259 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err2ASSERT_VIOLATIONDATA_RACE (42 of 104 remaining) [2023-08-26 08:38:03,259 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err3ASSERT_VIOLATIONDATA_RACE (41 of 104 remaining) [2023-08-26 08:38:03,259 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err4ASSERT_VIOLATIONDATA_RACE (40 of 104 remaining) [2023-08-26 08:38:03,259 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread5Err0ASSERT_VIOLATIONDATA_RACE (39 of 104 remaining) [2023-08-26 08:38:03,259 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread5Err1ASSERT_VIOLATIONDATA_RACE (38 of 104 remaining) [2023-08-26 08:38:03,259 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread5Err2ASSERT_VIOLATIONDATA_RACE (37 of 104 remaining) [2023-08-26 08:38:03,259 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread5Err3ASSERT_VIOLATIONDATA_RACE (36 of 104 remaining) [2023-08-26 08:38:03,259 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread5Err4ASSERT_VIOLATIONDATA_RACE (35 of 104 remaining) [2023-08-26 08:38:03,259 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread6Err0ASSERT_VIOLATIONDATA_RACE (34 of 104 remaining) [2023-08-26 08:38:03,260 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread6Err1ASSERT_VIOLATIONDATA_RACE (33 of 104 remaining) [2023-08-26 08:38:03,260 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread6Err2ASSERT_VIOLATIONDATA_RACE (32 of 104 remaining) [2023-08-26 08:38:03,260 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread6Err3ASSERT_VIOLATIONDATA_RACE (31 of 104 remaining) [2023-08-26 08:38:03,260 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread6Err4ASSERT_VIOLATIONDATA_RACE (30 of 104 remaining) [2023-08-26 08:38:03,260 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (29 of 104 remaining) [2023-08-26 08:38:03,260 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 104 remaining) [2023-08-26 08:38:03,260 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 104 remaining) [2023-08-26 08:38:03,260 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (26 of 104 remaining) [2023-08-26 08:38:03,260 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 104 remaining) [2023-08-26 08:38:03,260 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 104 remaining) [2023-08-26 08:38:03,261 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 104 remaining) [2023-08-26 08:38:03,261 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 104 remaining) [2023-08-26 08:38:03,261 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 104 remaining) [2023-08-26 08:38:03,261 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 104 remaining) [2023-08-26 08:38:03,261 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (19 of 104 remaining) [2023-08-26 08:38:03,261 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (18 of 104 remaining) [2023-08-26 08:38:03,261 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (17 of 104 remaining) [2023-08-26 08:38:03,261 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (16 of 104 remaining) [2023-08-26 08:38:03,261 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (15 of 104 remaining) [2023-08-26 08:38:03,261 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err0ASSERT_VIOLATIONDATA_RACE (14 of 104 remaining) [2023-08-26 08:38:03,261 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err1ASSERT_VIOLATIONDATA_RACE (13 of 104 remaining) [2023-08-26 08:38:03,262 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err2ASSERT_VIOLATIONDATA_RACE (12 of 104 remaining) [2023-08-26 08:38:03,262 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err3ASSERT_VIOLATIONDATA_RACE (11 of 104 remaining) [2023-08-26 08:38:03,262 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err4ASSERT_VIOLATIONDATA_RACE (10 of 104 remaining) [2023-08-26 08:38:03,262 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread5Err0ASSERT_VIOLATIONDATA_RACE (9 of 104 remaining) [2023-08-26 08:38:03,262 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread5Err1ASSERT_VIOLATIONDATA_RACE (8 of 104 remaining) [2023-08-26 08:38:03,262 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread5Err2ASSERT_VIOLATIONDATA_RACE (7 of 104 remaining) [2023-08-26 08:38:03,262 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread5Err3ASSERT_VIOLATIONDATA_RACE (6 of 104 remaining) [2023-08-26 08:38:03,262 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread5Err4ASSERT_VIOLATIONDATA_RACE (5 of 104 remaining) [2023-08-26 08:38:03,262 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread6Err0ASSERT_VIOLATIONDATA_RACE (4 of 104 remaining) [2023-08-26 08:38:03,262 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread6Err1ASSERT_VIOLATIONDATA_RACE (3 of 104 remaining) [2023-08-26 08:38:03,263 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 104 remaining) [2023-08-26 08:38:03,263 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread6Err3ASSERT_VIOLATIONDATA_RACE (1 of 104 remaining) [2023-08-26 08:38:03,263 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread6Err4ASSERT_VIOLATIONDATA_RACE (0 of 104 remaining) [2023-08-26 08:38:03,263 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:38:03,268 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 08:38:03,269 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 08:38:03,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 08:38:03 BasicIcfg [2023-08-26 08:38:03,271 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 08:38:03,272 INFO L158 Benchmark]: Toolchain (without parser) took 800951.92ms. Allocated memory was 379.6MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 355.6MB in the beginning and 13.1GB in the end (delta: -12.8GB). Peak memory consumption was 3.4GB. Max. memory is 16.0GB. [2023-08-26 08:38:03,272 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 379.6MB. Free memory is still 355.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 08:38:03,272 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.39ms. Allocated memory is still 379.6MB. Free memory was 355.6MB in the beginning and 342.9MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-26 08:38:03,272 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.09ms. Allocated memory is still 379.6MB. Free memory was 342.9MB in the beginning and 340.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 08:38:03,273 INFO L158 Benchmark]: Boogie Preprocessor took 46.84ms. Allocated memory is still 379.6MB. Free memory was 340.3MB in the beginning and 337.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 08:38:03,273 INFO L158 Benchmark]: RCFGBuilder took 794.84ms. Allocated memory is still 379.6MB. Free memory was 337.8MB in the beginning and 305.1MB in the end (delta: 32.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-08-26 08:38:03,273 INFO L158 Benchmark]: TraceAbstraction took 799741.45ms. Allocated memory was 379.6MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 304.6MB in the beginning and 13.1GB in the end (delta: -12.8GB). Peak memory consumption was 3.3GB. Max. memory is 16.0GB. [2023-08-26 08:38:03,274 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 379.6MB. Free memory is still 355.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 303.39ms. Allocated memory is still 379.6MB. Free memory was 355.6MB in the beginning and 342.9MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.09ms. Allocated memory is still 379.6MB. Free memory was 342.9MB in the beginning and 340.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 46.84ms. Allocated memory is still 379.6MB. Free memory was 340.3MB in the beginning and 337.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 794.84ms. Allocated memory is still 379.6MB. Free memory was 337.8MB in the beginning and 305.1MB in the end (delta: 32.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 799741.45ms. Allocated memory was 379.6MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 304.6MB in the beginning and 13.1GB in the end (delta: -12.8GB). Peak memory consumption was 3.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.4s, 437 PlacesBefore, 123 PlacesAfterwards, 442 TransitionsBefore, 116 TransitionsAfterwards, 28704 CoEnabledTransitionPairs, 10 FixpointIterations, 298 TrivialSequentialCompositions, 215 ConcurrentSequentialCompositions, 27 TrivialYvCompositions, 21 ConcurrentYvCompositions, 12 ChoiceCompositions, 573 TotalNumberOfCompositions, 59932 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 31864, independent: 31447, independent conditional: 0, independent unconditional: 31447, dependent: 417, dependent conditional: 0, dependent unconditional: 417, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 17256, independent: 17185, independent conditional: 0, independent unconditional: 17185, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 31864, independent: 14262, independent conditional: 0, independent unconditional: 14262, dependent: 346, dependent conditional: 0, dependent unconditional: 346, unknown: 17256, unknown conditional: 0, unknown unconditional: 17256] , Statistics on independence cache: Total cache size (in pairs): 734, Positive cache size: 704, Positive conditional cache size: 0, Positive unconditional cache size: 704, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 42]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 580 locations, 104 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: 799.6s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 675.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 20.7s, HoareTripleCheckerStatistics: 69 mSolverCounterUnknown, 1094 SdHoareTripleChecker+Valid, 179.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1094 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 178.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 211 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3683 IncrementalHoareTripleChecker+Invalid, 4029 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 0 mSDtfsCounter, 3683 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 697 GetRequests, 594 SyntacticMatches, 25 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 289.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=407occurred in iteration=14, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 64.2s SatisfiabilityAnalysisTime, 36.9s InterpolantComputationTime, 887 NumberOfCodeBlocks, 887 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1173 ConstructedInterpolants, 0 QuantifiedInterpolants, 14860 SizeOfPredicates, 16 NumberOfNonLiveVariables, 3542 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 29 InterpolantComputations, 8 PerfectInterpolantSequences, 148/198 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