/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/popl20-prod-cons3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 10:39:22,755 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 10:39:22,835 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 10:39:22,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 10:39:22,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 10:39:22,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 10:39:22,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 10:39:22,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 10:39:22,880 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 10:39:22,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 10:39:22,883 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 10:39:22,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 10:39:22,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 10:39:22,885 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 10:39:22,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 10:39:22,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 10:39:22,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 10:39:22,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 10:39:22,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 10:39:22,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 10:39:22,886 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 10:39:22,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 10:39:22,887 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 10:39:22,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 10:39:22,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 10:39:22,888 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 10:39:22,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 10:39:22,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 10:39:22,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 10:39:22,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 10:39:22,890 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 10:39:22,890 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 10:39:22,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 10:39:22,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 10:39:22,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 10:39:22,891 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 10:39:23,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 10:39:23,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 10:39:23,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 10:39:23,206 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 10:39:23,208 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 10:39:23,210 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c [2023-08-26 10:39:24,295 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 10:39:24,542 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 10:39:24,543 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c [2023-08-26 10:39:24,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14dc3021/aacaff42ca6344e19d9035db2c82be40/FLAG76b3b6a60 [2023-08-26 10:39:24,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a14dc3021/aacaff42ca6344e19d9035db2c82be40 [2023-08-26 10:39:24,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 10:39:24,565 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 10:39:24,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 10:39:24,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 10:39:24,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 10:39:24,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 10:39:24" (1/1) ... [2023-08-26 10:39:24,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@676fb65c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:39:24, skipping insertion in model container [2023-08-26 10:39:24,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 10:39:24" (1/1) ... [2023-08-26 10:39:24,602 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 10:39:24,825 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 10:39:24,836 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 10:39:24,897 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 10:39:24,904 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 10:39:24,904 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 10:39:24,912 INFO L206 MainTranslator]: Completed translation [2023-08-26 10:39:24,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:39:24 WrapperNode [2023-08-26 10:39:24,913 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 10:39:24,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 10:39:24,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 10:39:24,914 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 10:39:24,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:39:24" (1/1) ... [2023-08-26 10:39:24,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:39:24" (1/1) ... [2023-08-26 10:39:24,987 INFO L138 Inliner]: procedures = 26, calls = 74, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 507 [2023-08-26 10:39:24,988 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 10:39:24,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 10:39:24,989 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 10:39:24,989 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 10:39:24,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:39:24" (1/1) ... [2023-08-26 10:39:24,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:39:24" (1/1) ... [2023-08-26 10:39:25,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:39:24" (1/1) ... [2023-08-26 10:39:25,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:39:24" (1/1) ... [2023-08-26 10:39:25,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:39:24" (1/1) ... [2023-08-26 10:39:25,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:39:24" (1/1) ... [2023-08-26 10:39:25,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:39:24" (1/1) ... [2023-08-26 10:39:25,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:39:24" (1/1) ... [2023-08-26 10:39:25,065 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 10:39:25,066 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 10:39:25,066 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 10:39:25,066 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 10:39:25,067 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:39:24" (1/1) ... [2023-08-26 10:39:25,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 10:39:25,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:39:25,094 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 10:39:25,103 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 10:39:25,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 10:39:25,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 10:39:25,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 10:39:25,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 10:39:25,126 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 10:39:25,126 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 10:39:25,127 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 10:39:25,127 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 10:39:25,127 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 10:39:25,127 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 10:39:25,127 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-26 10:39:25,127 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-26 10:39:25,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 10:39:25,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 10:39:25,127 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 10:39:25,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-26 10:39:25,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 10:39:25,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 10:39:25,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 10:39:25,129 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 10:39:25,236 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 10:39:25,238 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 10:39:25,947 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 10:39:26,318 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 10:39:26,318 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-08-26 10:39:26,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 10:39:26 BoogieIcfgContainer [2023-08-26 10:39:26,322 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 10:39:26,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 10:39:26,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 10:39:26,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 10:39:26,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 10:39:24" (1/3) ... [2023-08-26 10:39:26,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c48c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 10:39:26, skipping insertion in model container [2023-08-26 10:39:26,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:39:24" (2/3) ... [2023-08-26 10:39:26,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c48c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 10:39:26, skipping insertion in model container [2023-08-26 10:39:26,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 10:39:26" (3/3) ... [2023-08-26 10:39:26,331 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons3.wvr.c [2023-08-26 10:39:26,344 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 10:39:26,344 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 73 error locations. [2023-08-26 10:39:26,344 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 10:39:26,465 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-26 10:39:26,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 388 places, 393 transitions, 818 flow [2023-08-26 10:39:26,603 INFO L124 PetriNetUnfolderBase]: 18/389 cut-off events. [2023-08-26 10:39:26,603 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 10:39:26,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 389 events. 18/389 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 491 event pairs, 0 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 326. Up to 3 conditions per place. [2023-08-26 10:39:26,610 INFO L82 GeneralOperation]: Start removeDead. Operand has 388 places, 393 transitions, 818 flow [2023-08-26 10:39:26,618 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 371 places, 376 transitions, 776 flow [2023-08-26 10:39:26,621 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 10:39:26,629 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 371 places, 376 transitions, 776 flow [2023-08-26 10:39:26,631 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 371 places, 376 transitions, 776 flow [2023-08-26 10:39:26,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 371 places, 376 transitions, 776 flow [2023-08-26 10:39:26,693 INFO L124 PetriNetUnfolderBase]: 18/376 cut-off events. [2023-08-26 10:39:26,694 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 10:39:26,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 376 events. 18/376 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 490 event pairs, 0 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 326. Up to 3 conditions per place. [2023-08-26 10:39:26,702 INFO L119 LiptonReduction]: Number of co-enabled transitions 10944 [2023-08-26 10:39:39,383 INFO L134 LiptonReduction]: Checked pairs total: 62603 [2023-08-26 10:39:39,383 INFO L136 LiptonReduction]: Total number of compositions: 396 [2023-08-26 10:39:39,395 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 10:39:39,401 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;@fffc8ce, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 10:39:39,401 INFO L358 AbstractCegarLoop]: Starting to check reachability of 126 error locations. [2023-08-26 10:39:39,402 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 10:39:39,402 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 10:39:39,402 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 10:39:39,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:39:39,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 10:39:39,403 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-26 10:39:39,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:39:39,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1972, now seen corresponding path program 1 times [2023-08-26 10:39:39,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:39:39,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350034625] [2023-08-26 10:39:39,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:39:39,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:39:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:39:39,501 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 10:39:39,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:39:39,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350034625] [2023-08-26 10:39:39,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350034625] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:39:39,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:39:39,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 10:39:39,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266603160] [2023-08-26 10:39:39,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:39:39,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 10:39:39,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:39:39,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 10:39:39,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 10:39:39,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 789 [2023-08-26 10:39:39,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 121 transitions, 266 flow. Second operand has 2 states, 2 states have (on average 312.5) internal successors, (625), 2 states have internal predecessors, (625), 0 states have call successors, (0), 0 states 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 10:39:39,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:39:39,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 789 [2023-08-26 10:39:39,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:39:40,000 INFO L124 PetriNetUnfolderBase]: 2173/3652 cut-off events. [2023-08-26 10:39:40,001 INFO L125 PetriNetUnfolderBase]: For 289/289 co-relation queries the response was YES. [2023-08-26 10:39:40,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6921 conditions, 3652 events. 2173/3652 cut-off events. For 289/289 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 19682 event pairs, 1717 based on Foata normal form. 0/3026 useless extension candidates. Maximal degree in co-relation 5722. Up to 2951 conditions per place. [2023-08-26 10:39:40,023 INFO L140 encePairwiseOnDemand]: 721/789 looper letters, 36 selfloop transitions, 0 changer transitions 0/53 dead transitions. [2023-08-26 10:39:40,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 53 transitions, 202 flow [2023-08-26 10:39:40,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 10:39:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 10:39:40,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 728 transitions. [2023-08-26 10:39:40,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46134347275031684 [2023-08-26 10:39:40,036 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 728 transitions. [2023-08-26 10:39:40,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 728 transitions. [2023-08-26 10:39:40,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:39:40,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 728 transitions. [2023-08-26 10:39:40,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 364.0) internal successors, (728), 2 states have internal predecessors, (728), 0 states have call successors, (0), 0 states 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 10:39:40,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 789.0) internal successors, (2367), 3 states have internal predecessors, (2367), 0 states have call successors, (0), 0 states 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 10:39:40,051 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 789.0) internal successors, (2367), 3 states have internal predecessors, (2367), 0 states have call successors, (0), 0 states 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 10:39:40,052 INFO L175 Difference]: Start difference. First operand has 129 places, 121 transitions, 266 flow. Second operand 2 states and 728 transitions. [2023-08-26 10:39:40,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 53 transitions, 202 flow [2023-08-26 10:39:40,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 186 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-26 10:39:40,060 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 114 flow [2023-08-26 10:39:40,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=114, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2023-08-26 10:39:40,065 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -75 predicate places. [2023-08-26 10:39:40,065 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 114 flow [2023-08-26 10:39:40,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 312.5) internal successors, (625), 2 states have internal predecessors, (625), 0 states have call successors, (0), 0 states 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 10:39:40,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:39:40,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 10:39:40,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 10:39:40,066 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-26 10:39:40,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:39:40,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1189152977, now seen corresponding path program 1 times [2023-08-26 10:39:40,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:39:40,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291098124] [2023-08-26 10:39:40,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:39:40,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:39:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:39:40,262 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 10:39:40,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:39:40,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291098124] [2023-08-26 10:39:40,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291098124] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:39:40,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:39:40,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 10:39:40,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952821904] [2023-08-26 10:39:40,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:39:40,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 10:39:40,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:39:40,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 10:39:40,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 10:39:40,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 789 [2023-08-26 10:39:40,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 302.0) internal successors, (906), 3 states have internal predecessors, (906), 0 states have call successors, (0), 0 states 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 10:39:40,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:39:40,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 789 [2023-08-26 10:39:40,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:39:40,759 INFO L124 PetriNetUnfolderBase]: 2645/4384 cut-off events. [2023-08-26 10:39:40,759 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-08-26 10:39:40,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8127 conditions, 4384 events. 2645/4384 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 23499 event pairs, 2127 based on Foata normal form. 0/3676 useless extension candidates. Maximal degree in co-relation 8124. Up to 3584 conditions per place. [2023-08-26 10:39:40,783 INFO L140 encePairwiseOnDemand]: 787/789 looper letters, 36 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2023-08-26 10:39:40,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 186 flow [2023-08-26 10:39:40,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 10:39:40,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 10:39:40,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 938 transitions. [2023-08-26 10:39:40,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39628221377270806 [2023-08-26 10:39:40,788 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 938 transitions. [2023-08-26 10:39:40,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 938 transitions. [2023-08-26 10:39:40,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:39:40,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 938 transitions. [2023-08-26 10:39:40,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states 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 10:39:40,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 789.0) internal successors, (3156), 4 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states 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 10:39:40,797 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 789.0) internal successors, (3156), 4 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states 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 10:39:40,798 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 114 flow. Second operand 3 states and 938 transitions. [2023-08-26 10:39:40,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 186 flow [2023-08-26 10:39:40,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 52 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 10:39:40,800 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 114 flow [2023-08-26 10:39:40,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2023-08-26 10:39:40,803 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -74 predicate places. [2023-08-26 10:39:40,804 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 114 flow [2023-08-26 10:39:40,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.0) internal successors, (906), 3 states have internal predecessors, (906), 0 states have call successors, (0), 0 states 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 10:39:40,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:39:40,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:39:40,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 10:39:40,810 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-26 10:39:40,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:39:40,812 INFO L85 PathProgramCache]: Analyzing trace with hash -602145056, now seen corresponding path program 1 times [2023-08-26 10:39:40,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:39:40,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530044002] [2023-08-26 10:39:40,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:39:40,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:39:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:39:41,319 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 10:39:41,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:39:41,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530044002] [2023-08-26 10:39:41,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530044002] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:39:41,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:39:41,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:39:41,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563949461] [2023-08-26 10:39:41,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:39:41,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:39:41,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:39:41,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:39:41,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:39:41,325 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 789 [2023-08-26 10:39:41,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 114 flow. Second operand has 6 states, 6 states have (on average 272.5) internal successors, (1635), 6 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states 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 10:39:41,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:39:41,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 789 [2023-08-26 10:39:41,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:39:42,257 INFO L124 PetriNetUnfolderBase]: 5673/7551 cut-off events. [2023-08-26 10:39:42,257 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 10:39:42,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15231 conditions, 7551 events. 5673/7551 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 30380 event pairs, 909 based on Foata normal form. 0/6405 useless extension candidates. Maximal degree in co-relation 15227. Up to 3208 conditions per place. [2023-08-26 10:39:42,296 INFO L140 encePairwiseOnDemand]: 784/789 looper letters, 106 selfloop transitions, 4 changer transitions 0/111 dead transitions. [2023-08-26 10:39:42,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 111 transitions, 452 flow [2023-08-26 10:39:42,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:39:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:39:42,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1731 transitions. [2023-08-26 10:39:42,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3656527249683143 [2023-08-26 10:39:42,301 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1731 transitions. [2023-08-26 10:39:42,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1731 transitions. [2023-08-26 10:39:42,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:39:42,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1731 transitions. [2023-08-26 10:39:42,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 288.5) internal successors, (1731), 6 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 10:39:42,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 789.0) internal successors, (5523), 7 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states 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 10:39:42,315 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 789.0) internal successors, (5523), 7 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states 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 10:39:42,315 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 114 flow. Second operand 6 states and 1731 transitions. [2023-08-26 10:39:42,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 111 transitions, 452 flow [2023-08-26 10:39:42,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 111 transitions, 451 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 10:39:42,318 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 119 flow [2023-08-26 10:39:42,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=119, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2023-08-26 10:39:42,318 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -71 predicate places. [2023-08-26 10:39:42,319 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 119 flow [2023-08-26 10:39:42,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 272.5) internal successors, (1635), 6 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states 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 10:39:42,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:39:42,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:39:42,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 10:39:42,320 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-26 10:39:42,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:39:42,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1526995189, now seen corresponding path program 1 times [2023-08-26 10:39:42,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:39:42,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159913947] [2023-08-26 10:39:42,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:39:42,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:39:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:39:42,698 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 10:39:42,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:39:42,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159913947] [2023-08-26 10:39:42,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159913947] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:39:42,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:39:42,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:39:42,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426905742] [2023-08-26 10:39:42,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:39:42,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:39:42,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:39:42,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:39:42,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:39:42,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 789 [2023-08-26 10:39:42,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 273.8333333333333) internal successors, (1643), 6 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states 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 10:39:42,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:39:42,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 789 [2023-08-26 10:39:42,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:39:43,517 INFO L124 PetriNetUnfolderBase]: 5548/7376 cut-off events. [2023-08-26 10:39:43,517 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2023-08-26 10:39:43,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15681 conditions, 7376 events. 5548/7376 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 29355 event pairs, 3864 based on Foata normal form. 0/6300 useless extension candidates. Maximal degree in co-relation 15677. Up to 6318 conditions per place. [2023-08-26 10:39:43,547 INFO L140 encePairwiseOnDemand]: 784/789 looper letters, 89 selfloop transitions, 4 changer transitions 0/94 dead transitions. [2023-08-26 10:39:43,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 94 transitions, 391 flow [2023-08-26 10:39:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:39:43,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:39:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1714 transitions. [2023-08-26 10:39:43,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3620616814533164 [2023-08-26 10:39:43,552 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1714 transitions. [2023-08-26 10:39:43,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1714 transitions. [2023-08-26 10:39:43,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:39:43,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1714 transitions. [2023-08-26 10:39:43,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 285.6666666666667) internal successors, (1714), 6 states have internal predecessors, (1714), 0 states have call successors, (0), 0 states 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 10:39:43,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 789.0) internal successors, (5523), 7 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states 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 10:39:43,565 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 789.0) internal successors, (5523), 7 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states 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 10:39:43,566 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 119 flow. Second operand 6 states and 1714 transitions. [2023-08-26 10:39:43,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 94 transitions, 391 flow [2023-08-26 10:39:43,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 94 transitions, 384 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 10:39:43,572 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 118 flow [2023-08-26 10:39:43,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-26 10:39:43,573 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -71 predicate places. [2023-08-26 10:39:43,573 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 118 flow [2023-08-26 10:39:43,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 273.8333333333333) internal successors, (1643), 6 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states 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 10:39:43,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:39:43,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:39:43,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 10:39:43,574 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-26 10:39:43,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:39:43,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1633722716, now seen corresponding path program 1 times [2023-08-26 10:39:43,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:39:43,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080278227] [2023-08-26 10:39:43,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:39:43,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:39:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:39:43,664 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 10:39:43,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:39:43,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080278227] [2023-08-26 10:39:43,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080278227] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:39:43,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:39:43,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 10:39:43,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965640307] [2023-08-26 10:39:43,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:39:43,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 10:39:43,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:39:43,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 10:39:43,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 10:39:43,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 789 [2023-08-26 10:39:43,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 311.75) internal successors, (1247), 4 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states 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 10:39:43,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:39:43,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 789 [2023-08-26 10:39:43,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:39:44,033 INFO L124 PetriNetUnfolderBase]: 2205/3192 cut-off events. [2023-08-26 10:39:44,033 INFO L125 PetriNetUnfolderBase]: For 117/142 co-relation queries the response was YES. [2023-08-26 10:39:44,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6456 conditions, 3192 events. 2205/3192 cut-off events. For 117/142 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 14391 event pairs, 145 based on Foata normal form. 5/2774 useless extension candidates. Maximal degree in co-relation 6452. Up to 1160 conditions per place. [2023-08-26 10:39:44,050 INFO L140 encePairwiseOnDemand]: 784/789 looper letters, 79 selfloop transitions, 5 changer transitions 0/98 dead transitions. [2023-08-26 10:39:44,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 98 transitions, 393 flow [2023-08-26 10:39:44,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 10:39:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 10:39:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1621 transitions. [2023-08-26 10:39:44,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4108998732572877 [2023-08-26 10:39:44,054 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1621 transitions. [2023-08-26 10:39:44,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1621 transitions. [2023-08-26 10:39:44,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:39:44,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1621 transitions. [2023-08-26 10:39:44,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 324.2) internal successors, (1621), 5 states have internal predecessors, (1621), 0 states have call successors, (0), 0 states 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 10:39:44,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 789.0) internal successors, (4734), 6 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states 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 10:39:44,065 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 789.0) internal successors, (4734), 6 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states 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 10:39:44,065 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 118 flow. Second operand 5 states and 1621 transitions. [2023-08-26 10:39:44,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 98 transitions, 393 flow [2023-08-26 10:39:44,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 98 transitions, 377 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-26 10:39:44,068 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 139 flow [2023-08-26 10:39:44,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2023-08-26 10:39:44,068 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -69 predicate places. [2023-08-26 10:39:44,069 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 139 flow [2023-08-26 10:39:44,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 311.75) internal successors, (1247), 4 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states 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 10:39:44,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:39:44,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:39:44,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 10:39:44,070 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-26 10:39:44,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:39:44,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1840018890, now seen corresponding path program 1 times [2023-08-26 10:39:44,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:39:44,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639057822] [2023-08-26 10:39:44,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:39:44,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:39:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:39:44,506 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 10:39:44,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:39:44,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639057822] [2023-08-26 10:39:44,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639057822] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:39:44,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:39:44,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:39:44,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390682320] [2023-08-26 10:39:44,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:39:44,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:39:44,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:39:44,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:39:44,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:39:44,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 789 [2023-08-26 10:39:44,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 139 flow. Second operand has 6 states, 6 states have (on average 275.3333333333333) internal successors, (1652), 6 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states 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 10:39:44,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:39:44,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 789 [2023-08-26 10:39:44,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:39:45,282 INFO L124 PetriNetUnfolderBase]: 5985/8023 cut-off events. [2023-08-26 10:39:45,283 INFO L125 PetriNetUnfolderBase]: For 2856/2856 co-relation queries the response was YES. [2023-08-26 10:39:45,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18549 conditions, 8023 events. 5985/8023 cut-off events. For 2856/2856 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 33832 event pairs, 4657 based on Foata normal form. 0/7213 useless extension candidates. Maximal degree in co-relation 18542. Up to 7969 conditions per place. [2023-08-26 10:39:45,324 INFO L140 encePairwiseOnDemand]: 784/789 looper letters, 67 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2023-08-26 10:39:45,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 319 flow [2023-08-26 10:39:45,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:39:45,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:39:45,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1689 transitions. [2023-08-26 10:39:45,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3567807351077313 [2023-08-26 10:39:45,329 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1689 transitions. [2023-08-26 10:39:45,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1689 transitions. [2023-08-26 10:39:45,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:39:45,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1689 transitions. [2023-08-26 10:39:45,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 281.5) internal successors, (1689), 6 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states 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 10:39:45,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 789.0) internal successors, (5523), 7 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states 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 10:39:45,339 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 789.0) internal successors, (5523), 7 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states 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 10:39:45,340 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 139 flow. Second operand 6 states and 1689 transitions. [2023-08-26 10:39:45,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 319 flow [2023-08-26 10:39:45,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 72 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 10:39:45,343 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 142 flow [2023-08-26 10:39:45,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-08-26 10:39:45,344 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -66 predicate places. [2023-08-26 10:39:45,344 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 142 flow [2023-08-26 10:39:45,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.3333333333333) internal successors, (1652), 6 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states 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 10:39:45,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:39:45,345 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, 1, 1] [2023-08-26 10:39:45,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 10:39:45,345 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-26 10:39:45,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:39:45,346 INFO L85 PathProgramCache]: Analyzing trace with hash 925835819, now seen corresponding path program 1 times [2023-08-26 10:39:45,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:39:45,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359712234] [2023-08-26 10:39:45,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:39:45,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:39:45,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:39:45,451 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 10:39:45,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:39:45,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359712234] [2023-08-26 10:39:45,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359712234] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:39:45,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:39:45,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 10:39:45,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121802107] [2023-08-26 10:39:45,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:39:45,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 10:39:45,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:39:45,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 10:39:45,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 10:39:45,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 789 [2023-08-26 10:39:45,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 313.5) internal successors, (1254), 4 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states 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 10:39:45,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:39:45,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 789 [2023-08-26 10:39:45,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:39:45,928 INFO L124 PetriNetUnfolderBase]: 2555/3755 cut-off events. [2023-08-26 10:39:45,929 INFO L125 PetriNetUnfolderBase]: For 1013/1047 co-relation queries the response was YES. [2023-08-26 10:39:45,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8231 conditions, 3755 events. 2555/3755 cut-off events. For 1013/1047 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 17512 event pairs, 333 based on Foata normal form. 2/3425 useless extension candidates. Maximal degree in co-relation 8224. Up to 1507 conditions per place. [2023-08-26 10:39:45,948 INFO L140 encePairwiseOnDemand]: 784/789 looper letters, 79 selfloop transitions, 7 changer transitions 0/99 dead transitions. [2023-08-26 10:39:45,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 99 transitions, 437 flow [2023-08-26 10:39:45,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 10:39:45,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 10:39:45,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1619 transitions. [2023-08-26 10:39:45,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41039290240811155 [2023-08-26 10:39:45,953 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1619 transitions. [2023-08-26 10:39:45,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1619 transitions. [2023-08-26 10:39:45,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:39:45,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1619 transitions. [2023-08-26 10:39:45,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 323.8) internal successors, (1619), 5 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states 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 10:39:45,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 789.0) internal successors, (4734), 6 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states 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 10:39:45,964 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 789.0) internal successors, (4734), 6 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states 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 10:39:45,964 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 142 flow. Second operand 5 states and 1619 transitions. [2023-08-26 10:39:45,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 99 transitions, 437 flow [2023-08-26 10:39:45,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 99 transitions, 428 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 10:39:45,974 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 179 flow [2023-08-26 10:39:45,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2023-08-26 10:39:45,974 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -63 predicate places. [2023-08-26 10:39:45,975 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 179 flow [2023-08-26 10:39:45,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 313.5) internal successors, (1254), 4 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states 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 10:39:45,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:39:45,975 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, 1, 1] [2023-08-26 10:39:45,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 10:39:45,976 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-26 10:39:45,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:39:45,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1736758879, now seen corresponding path program 2 times [2023-08-26 10:39:45,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:39:45,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008500536] [2023-08-26 10:39:45,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:39:45,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:39:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:39:46,251 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 10:39:46,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:39:46,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008500536] [2023-08-26 10:39:46,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008500536] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:39:46,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:39:46,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:39:46,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838658242] [2023-08-26 10:39:46,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:39:46,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:39:46,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:39:46,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:39:46,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:39:46,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 789 [2023-08-26 10:39:46,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 179 flow. Second operand has 6 states, 6 states have (on average 305.3333333333333) internal successors, (1832), 6 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states 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 10:39:46,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:39:46,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 789 [2023-08-26 10:39:46,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:39:47,017 INFO L124 PetriNetUnfolderBase]: 4571/6859 cut-off events. [2023-08-26 10:39:47,018 INFO L125 PetriNetUnfolderBase]: For 3503/3530 co-relation queries the response was YES. [2023-08-26 10:39:47,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16237 conditions, 6859 events. 4571/6859 cut-off events. For 3503/3530 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 36904 event pairs, 449 based on Foata normal form. 168/6615 useless extension candidates. Maximal degree in co-relation 16227. Up to 2132 conditions per place. [2023-08-26 10:39:47,061 INFO L140 encePairwiseOnDemand]: 782/789 looper letters, 91 selfloop transitions, 7 changer transitions 21/132 dead transitions. [2023-08-26 10:39:47,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 132 transitions, 644 flow [2023-08-26 10:39:47,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 10:39:47,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 10:39:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2215 transitions. [2023-08-26 10:39:47,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40105015390186494 [2023-08-26 10:39:47,067 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2215 transitions. [2023-08-26 10:39:47,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2215 transitions. [2023-08-26 10:39:47,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:39:47,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2215 transitions. [2023-08-26 10:39:47,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 316.42857142857144) internal successors, (2215), 7 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states 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 10:39:47,086 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 789.0) internal successors, (6312), 8 states have internal predecessors, (6312), 0 states have call successors, (0), 0 states 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 10:39:47,088 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 789.0) internal successors, (6312), 8 states have internal predecessors, (6312), 0 states have call successors, (0), 0 states 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 10:39:47,088 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 179 flow. Second operand 7 states and 2215 transitions. [2023-08-26 10:39:47,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 132 transitions, 644 flow [2023-08-26 10:39:47,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 132 transitions, 639 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 10:39:47,097 INFO L231 Difference]: Finished difference. Result has 73 places, 54 transitions, 186 flow [2023-08-26 10:39:47,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=73, PETRI_TRANSITIONS=54} [2023-08-26 10:39:47,099 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -56 predicate places. [2023-08-26 10:39:47,099 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 54 transitions, 186 flow [2023-08-26 10:39:47,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 305.3333333333333) internal successors, (1832), 6 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states 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 10:39:47,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:39:47,100 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, 1, 1, 1, 1, 1] [2023-08-26 10:39:47,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 10:39:47,100 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-26 10:39:47,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:39:47,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1870030227, now seen corresponding path program 1 times [2023-08-26 10:39:47,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:39:47,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209692747] [2023-08-26 10:39:47,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:39:47,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:39:47,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:39:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:39:47,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:39:47,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209692747] [2023-08-26 10:39:47,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209692747] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:39:47,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:39:47,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 10:39:47,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564968062] [2023-08-26 10:39:47,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:39:47,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 10:39:47,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:39:47,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 10:39:47,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 10:39:47,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 789 [2023-08-26 10:39:47,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 54 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 0 states 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 10:39:47,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:39:47,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 789 [2023-08-26 10:39:47,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:39:47,588 INFO L124 PetriNetUnfolderBase]: 2485/3633 cut-off events. [2023-08-26 10:39:47,588 INFO L125 PetriNetUnfolderBase]: For 3149/3149 co-relation queries the response was YES. [2023-08-26 10:39:47,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9418 conditions, 3633 events. 2485/3633 cut-off events. For 3149/3149 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 16274 event pairs, 669 based on Foata normal form. 54/3467 useless extension candidates. Maximal degree in co-relation 9406. Up to 3093 conditions per place. [2023-08-26 10:39:47,612 INFO L140 encePairwiseOnDemand]: 786/789 looper letters, 51 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-26 10:39:47,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 66 transitions, 316 flow [2023-08-26 10:39:47,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 10:39:47,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 10:39:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2023-08-26 10:39:47,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41191381495564006 [2023-08-26 10:39:47,615 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 975 transitions. [2023-08-26 10:39:47,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 975 transitions. [2023-08-26 10:39:47,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:39:47,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 975 transitions. [2023-08-26 10:39:47,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 0 states have call successors, (0), 0 states 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 10:39:47,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 789.0) internal successors, (3156), 4 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states 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 10:39:47,622 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 789.0) internal successors, (3156), 4 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states 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 10:39:47,622 INFO L175 Difference]: Start difference. First operand has 73 places, 54 transitions, 186 flow. Second operand 3 states and 975 transitions. [2023-08-26 10:39:47,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 66 transitions, 316 flow [2023-08-26 10:39:47,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 288 flow, removed 1 selfloop flow, removed 11 redundant places. [2023-08-26 10:39:47,627 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 160 flow [2023-08-26 10:39:47,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2023-08-26 10:39:47,628 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -64 predicate places. [2023-08-26 10:39:47,628 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 160 flow [2023-08-26 10:39:47,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 0 states 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 10:39:47,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:39:47,629 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:39:47,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 10:39:47,629 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-26 10:39:47,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:39:47,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1428632059, now seen corresponding path program 1 times [2023-08-26 10:39:47,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:39:47,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503090436] [2023-08-26 10:39:47,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:39:47,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:39:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:39:47,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:39:47,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:39:47,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503090436] [2023-08-26 10:39:47,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503090436] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:39:47,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:39:47,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 10:39:47,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951027315] [2023-08-26 10:39:47,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:39:47,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 10:39:47,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:39:47,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 10:39:47,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 10:39:47,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 789 [2023-08-26 10:39:47,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states 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 10:39:47,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:39:47,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 789 [2023-08-26 10:39:47,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:39:48,093 INFO L124 PetriNetUnfolderBase]: 2096/3332 cut-off events. [2023-08-26 10:39:48,094 INFO L125 PetriNetUnfolderBase]: For 1591/1625 co-relation queries the response was YES. [2023-08-26 10:39:48,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8230 conditions, 3332 events. 2096/3332 cut-off events. For 1591/1625 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15456 event pairs, 1003 based on Foata normal form. 48/3143 useless extension candidates. Maximal degree in co-relation 8220. Up to 2752 conditions per place. [2023-08-26 10:39:48,109 INFO L140 encePairwiseOnDemand]: 786/789 looper letters, 49 selfloop transitions, 2 changer transitions 3/67 dead transitions. [2023-08-26 10:39:48,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 67 transitions, 304 flow [2023-08-26 10:39:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 10:39:48,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 10:39:48,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2023-08-26 10:39:48,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41191381495564006 [2023-08-26 10:39:48,113 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 975 transitions. [2023-08-26 10:39:48,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 975 transitions. [2023-08-26 10:39:48,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:39:48,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 975 transitions. [2023-08-26 10:39:48,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 0 states have call successors, (0), 0 states 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 10:39:48,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 789.0) internal successors, (3156), 4 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states 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 10:39:48,119 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 789.0) internal successors, (3156), 4 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states 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 10:39:48,119 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 160 flow. Second operand 3 states and 975 transitions. [2023-08-26 10:39:48,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 67 transitions, 304 flow [2023-08-26 10:39:48,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 67 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 10:39:48,122 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 170 flow [2023-08-26 10:39:48,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2023-08-26 10:39:48,124 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -62 predicate places. [2023-08-26 10:39:48,124 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 170 flow [2023-08-26 10:39:48,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states 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 10:39:48,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:39:48,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:39:48,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 10:39:48,124 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-26 10:39:48,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:39:48,125 INFO L85 PathProgramCache]: Analyzing trace with hash -480627784, now seen corresponding path program 1 times [2023-08-26 10:39:48,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:39:48,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545667291] [2023-08-26 10:39:48,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:39:48,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:39:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:39:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 10:39:48,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:39:48,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545667291] [2023-08-26 10:39:48,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545667291] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:39:48,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:39:48,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 10:39:48,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903223393] [2023-08-26 10:39:48,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:39:48,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 10:39:48,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:39:48,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 10:39:48,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 10:39:48,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 789 [2023-08-26 10:39:48,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 281.5) internal successors, (1126), 4 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states 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 10:39:48,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:39:48,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 789 [2023-08-26 10:39:48,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:39:48,739 INFO L124 PetriNetUnfolderBase]: 2228/3548 cut-off events. [2023-08-26 10:39:48,739 INFO L125 PetriNetUnfolderBase]: For 2012/2034 co-relation queries the response was YES. [2023-08-26 10:39:48,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9194 conditions, 3548 events. 2228/3548 cut-off events. For 2012/2034 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 16788 event pairs, 1657 based on Foata normal form. 22/3307 useless extension candidates. Maximal degree in co-relation 9183. Up to 2984 conditions per place. [2023-08-26 10:39:48,757 INFO L140 encePairwiseOnDemand]: 785/789 looper letters, 40 selfloop transitions, 2 changer transitions 18/73 dead transitions. [2023-08-26 10:39:48,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 337 flow [2023-08-26 10:39:48,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 10:39:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 10:39:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1148 transitions. [2023-08-26 10:39:48,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3637515842839037 [2023-08-26 10:39:48,761 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1148 transitions. [2023-08-26 10:39:48,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1148 transitions. [2023-08-26 10:39:48,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:39:48,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1148 transitions. [2023-08-26 10:39:48,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states 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 10:39:48,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 789.0) internal successors, (3945), 5 states have internal predecessors, (3945), 0 states have call successors, (0), 0 states 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 10:39:48,769 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 789.0) internal successors, (3945), 5 states have internal predecessors, (3945), 0 states have call successors, (0), 0 states 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 10:39:48,769 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 170 flow. Second operand 4 states and 1148 transitions. [2023-08-26 10:39:48,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 337 flow [2023-08-26 10:39:48,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 73 transitions, 335 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 10:39:48,774 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 182 flow [2023-08-26 10:39:48,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2023-08-26 10:39:48,775 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -58 predicate places. [2023-08-26 10:39:48,775 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 182 flow [2023-08-26 10:39:48,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 281.5) internal successors, (1126), 4 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states 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 10:39:48,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:39:48,776 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:39:48,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 10:39:48,776 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-26 10:39:48,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:39:48,776 INFO L85 PathProgramCache]: Analyzing trace with hash -622570275, now seen corresponding path program 1 times [2023-08-26 10:39:48,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:39:48,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693964434] [2023-08-26 10:39:48,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:39:48,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:39:48,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:39:48,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 10:39:48,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:39:48,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693964434] [2023-08-26 10:39:48,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693964434] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:39:48,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:39:48,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 10:39:48,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446458857] [2023-08-26 10:39:48,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:39:48,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 10:39:48,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:39:48,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 10:39:48,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 10:39:48,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 789 [2023-08-26 10:39:48,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 281.75) internal successors, (1127), 4 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states 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 10:39:48,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:39:48,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 789 [2023-08-26 10:39:48,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:39:49,314 INFO L124 PetriNetUnfolderBase]: 2437/3937 cut-off events. [2023-08-26 10:39:49,314 INFO L125 PetriNetUnfolderBase]: For 2298/2320 co-relation queries the response was YES. [2023-08-26 10:39:49,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10107 conditions, 3937 events. 2437/3937 cut-off events. For 2298/2320 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 19353 event pairs, 1835 based on Foata normal form. 34/3675 useless extension candidates. Maximal degree in co-relation 10094. Up to 2985 conditions per place. [2023-08-26 10:39:49,333 INFO L140 encePairwiseOnDemand]: 785/789 looper letters, 41 selfloop transitions, 2 changer transitions 19/75 dead transitions. [2023-08-26 10:39:49,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 75 transitions, 363 flow [2023-08-26 10:39:49,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 10:39:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 10:39:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1148 transitions. [2023-08-26 10:39:49,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3637515842839037 [2023-08-26 10:39:49,336 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1148 transitions. [2023-08-26 10:39:49,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1148 transitions. [2023-08-26 10:39:49,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:39:49,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1148 transitions. [2023-08-26 10:39:49,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states 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 10:39:49,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 789.0) internal successors, (3945), 5 states have internal predecessors, (3945), 0 states have call successors, (0), 0 states 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 10:39:49,343 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 789.0) internal successors, (3945), 5 states have internal predecessors, (3945), 0 states have call successors, (0), 0 states 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 10:39:49,343 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 182 flow. Second operand 4 states and 1148 transitions. [2023-08-26 10:39:49,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 75 transitions, 363 flow [2023-08-26 10:39:49,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 75 transitions, 355 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-26 10:39:49,351 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 190 flow [2023-08-26 10:39:49,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2023-08-26 10:39:49,351 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -56 predicate places. [2023-08-26 10:39:49,351 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 190 flow [2023-08-26 10:39:49,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 281.75) internal successors, (1127), 4 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states 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 10:39:49,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:39:49,352 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:39:49,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 10:39:49,352 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-26 10:39:49,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:39:49,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1396244327, now seen corresponding path program 1 times [2023-08-26 10:39:49,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:39:49,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095155904] [2023-08-26 10:39:49,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:39:49,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:39:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:39:53,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:39:53,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:39:53,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095155904] [2023-08-26 10:39:53,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095155904] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:39:53,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873041370] [2023-08-26 10:39:53,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:39:53,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:39:53,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:39:53,348 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 10:39:53,403 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 10:39:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:39:53,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 57 conjunts are in the unsatisfiable core [2023-08-26 10:39:53,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:39:54,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:39:54,587 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 10:39:54,964 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2023-08-26 10:39:55,047 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 10:39:55,052 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:39:55,052 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2023-08-26 10:39:55,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:39:55,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:39:55,561 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:39:55,562 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 17 [2023-08-26 10:39:56,075 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:39:56,076 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 159 treesize of output 203 [2023-08-26 10:39:56,118 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:39:56,119 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 103 [2023-08-26 10:39:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:39:58,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873041370] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:39:58,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:39:58,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 50 [2023-08-26 10:39:58,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440246954] [2023-08-26 10:39:58,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:39:58,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-08-26 10:39:58,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:39:58,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-08-26 10:39:58,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2357, Unknown=7, NotChecked=0, Total=2550 [2023-08-26 10:39:58,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 789 [2023-08-26 10:39:58,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 190 flow. Second operand has 51 states, 51 states have (on average 188.23529411764707) internal successors, (9600), 51 states have internal predecessors, (9600), 0 states have call successors, (0), 0 states 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 10:39:58,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:39:58,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 789 [2023-08-26 10:39:58,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:40:12,567 WARN L234 SmtUtils]: Spent 7.34s on a formula simplification. DAG size of input: 177 DAG size of output: 143 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:40:25,413 WARN L234 SmtUtils]: Spent 10.02s on a formula simplification. DAG size of input: 175 DAG size of output: 138 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:40:30,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:40:32,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:40:34,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:40:37,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:40:39,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:40:41,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:40:53,105 WARN L234 SmtUtils]: Spent 10.35s on a formula simplification. DAG size of input: 120 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:41:07,693 WARN L234 SmtUtils]: Spent 14.48s on a formula simplification. DAG size of input: 107 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:41:26,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:41:29,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:41:38,901 WARN L234 SmtUtils]: Spent 8.27s on a formula simplification. DAG size of input: 183 DAG size of output: 144 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:41:40,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:41:55,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:41:58,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:42:00,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:42:02,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:42:15,428 WARN L234 SmtUtils]: Spent 10.75s on a formula simplification. DAG size of input: 181 DAG size of output: 139 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:42:17,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:42:20,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:42:23,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:42:25,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:42:27,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:42:29,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:42:37,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:42:39,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:42:41,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:42:43,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:42:46,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:42:48,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:42:50,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:42:52,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:42:57,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:43:00,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:43:11,059 WARN L234 SmtUtils]: Spent 10.70s on a formula simplification. DAG size of input: 126 DAG size of output: 99 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:43:13,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:43:15,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:43:17,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:43:27,110 WARN L234 SmtUtils]: Spent 8.95s on a formula simplification. DAG size of input: 121 DAG size of output: 100 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:43:29,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:43:42,994 WARN L234 SmtUtils]: Spent 13.22s on a formula simplification. DAG size of input: 151 DAG size of output: 115 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:43:45,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:43:48,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:43:50,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:43:52,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:43:54,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:43:56,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:43:59,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:44:06,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:44:08,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:44:22,662 WARN L234 SmtUtils]: Spent 7.35s on a formula simplification. DAG size of input: 110 DAG size of output: 96 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:44:25,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:44:27,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:44:30,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:44:33,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:44:35,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:44:38,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:44:42,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:45:04,979 WARN L234 SmtUtils]: Spent 14.18s on a formula simplification. DAG size of input: 110 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:45:06,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:45:08,999 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:45:11,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:45:13,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:45:16,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:45:19,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:45:22,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:45:23,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:45:26,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:45:28,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:45:30,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:45:32,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:45:34,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:45:36,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:45:38,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:46:04,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:46:06,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:46:08,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:46:10,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:46:13,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:46:16,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:46:18,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:46:20,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:46:22,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:46:24,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:46:26,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:46:29,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:46:30,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:46:32,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:46:34,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:46:38,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:46:40,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:46:42,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:46:51,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:46:53,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:46:56,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:46:59,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:47:01,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:47:03,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:47:05,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:47:09,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:47:11,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:47:14,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:47:21,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:47:27,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:47:29,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:47:31,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:47:32,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:47:34,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:47:36,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:47:42,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:47:49,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:47:51,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:47:53,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:47:57,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:47:59,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:02,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:04,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:06,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:08,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:10,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:12,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:14,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:16,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:18,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:20,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:26,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:28,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:30,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:32,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:34,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:36,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:38,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:40,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:42,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:48:44,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:48:50,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:56,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:48:59,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:49:01,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:49:04,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:49:06,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:49:08,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:49:12,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:49:16,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:49:18,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:49:21,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:49:26,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:49:30,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:49:32,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:49:36,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:49:38,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:49:40,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:49:42,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:49:43,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:49:45,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:49:48,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:49:51,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:49:53,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:49:56,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:49:58,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 [1] [2023-08-26 10:50:00,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:50:02,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:50:05,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:50:07,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:50:10,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:50:12,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:50:14,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:50:18,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:50:22,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 10:50:25,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:50:27,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:50:29,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:50:31,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:50:33,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:50:37,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:50:42,155 INFO L124 PetriNetUnfolderBase]: 78137/107827 cut-off events. [2023-08-26 10:50:42,155 INFO L125 PetriNetUnfolderBase]: For 74211/74211 co-relation queries the response was YES. [2023-08-26 10:50:42,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300785 conditions, 107827 events. 78137/107827 cut-off events. For 74211/74211 co-relation queries the response was YES. Maximal size of possible extension queue 2245. Compared 678228 event pairs, 2332 based on Foata normal form. 1656/101955 useless extension candidates. Maximal degree in co-relation 300771. Up to 16904 conditions per place. [2023-08-26 10:50:42,831 INFO L140 encePairwiseOnDemand]: 768/789 looper letters, 4043 selfloop transitions, 805 changer transitions 158/5007 dead transitions. [2023-08-26 10:50:42,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 5007 transitions, 23653 flow [2023-08-26 10:50:42,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 267 states. [2023-08-26 10:50:42,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2023-08-26 10:50:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 54625 transitions. [2023-08-26 10:50:43,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25930039921580916 [2023-08-26 10:50:43,033 INFO L72 ComplementDD]: Start complementDD. Operand 267 states and 54625 transitions. [2023-08-26 10:50:43,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 267 states and 54625 transitions. [2023-08-26 10:50:43,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:50:43,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 267 states and 54625 transitions. [2023-08-26 10:50:43,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 268 states, 267 states have (on average 204.5880149812734) internal successors, (54625), 267 states have internal predecessors, (54625), 0 states have call successors, (0), 0 states 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 10:50:43,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 268 states, 268 states have (on average 789.0) internal successors, (211452), 268 states have internal predecessors, (211452), 0 states have call successors, (0), 0 states 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 10:50:43,353 INFO L81 ComplementDD]: Finished complementDD. Result has 268 states, 268 states have (on average 789.0) internal successors, (211452), 268 states have internal predecessors, (211452), 0 states have call successors, (0), 0 states 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 10:50:43,353 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 190 flow. Second operand 267 states and 54625 transitions. [2023-08-26 10:50:43,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 5007 transitions, 23653 flow [2023-08-26 10:50:43,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 5007 transitions, 23556 flow, removed 45 selfloop flow, removed 2 redundant places. [2023-08-26 10:50:43,622 INFO L231 Difference]: Finished difference. Result has 450 places, 1040 transitions, 6919 flow [2023-08-26 10:50:43,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=267, PETRI_FLOW=6919, PETRI_PLACES=450, PETRI_TRANSITIONS=1040} [2023-08-26 10:50:43,623 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, 321 predicate places. [2023-08-26 10:50:43,623 INFO L495 AbstractCegarLoop]: Abstraction has has 450 places, 1040 transitions, 6919 flow [2023-08-26 10:50:43,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 188.23529411764707) internal successors, (9600), 51 states have internal predecessors, (9600), 0 states have call successors, (0), 0 states 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 10:50:43,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:50:43,625 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:50:43,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-26 10:50:43,831 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,SelfDestructingSolverStorable12 [2023-08-26 10:50:43,832 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-26 10:50:43,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:50:43,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1604558203, now seen corresponding path program 2 times [2023-08-26 10:50:43,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:50:43,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032016415] [2023-08-26 10:50:43,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:50:43,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:50:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:50:48,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:50:48,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:50:48,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032016415] [2023-08-26 10:50:48,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032016415] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:50:48,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139006017] [2023-08-26 10:50:48,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 10:50:48,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:50:48,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:50:48,354 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 10:50:48,355 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 10:50:48,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 10:50:48,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 10:50:48,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-26 10:50:48,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:50:49,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:50:49,449 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-26 10:50:49,672 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2023-08-26 10:50:49,832 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:50:49,833 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 30 [2023-08-26 10:50:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:50:50,164 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:50:50,693 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:50:50,693 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 17 [2023-08-26 10:50:51,249 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:50:51,250 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 159 treesize of output 203 [2023-08-26 10:50:51,325 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:50:51,326 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 103 [2023-08-26 10:50:53,639 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:50:53,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139006017] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:50:53,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:50:53,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 44 [2023-08-26 10:50:53,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754174266] [2023-08-26 10:50:53,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:50:53,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-08-26 10:50:53,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:50:53,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-08-26 10:50:53,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1823, Unknown=3, NotChecked=0, Total=1980 [2023-08-26 10:50:53,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 789 [2023-08-26 10:50:53,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 1040 transitions, 6919 flow. Second operand has 45 states, 45 states have (on average 196.66666666666666) internal successors, (8850), 45 states have internal predecessors, (8850), 0 states have call successors, (0), 0 states 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 10:50:53,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:50:53,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 789 [2023-08-26 10:50:53,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:51:25,414 WARN L234 SmtUtils]: Spent 20.83s on a formula simplification. DAG size of input: 135 DAG size of output: 90 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:51:43,768 WARN L234 SmtUtils]: Spent 14.45s on a formula simplification. DAG size of input: 116 DAG size of output: 78 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:51:58,730 WARN L234 SmtUtils]: Spent 14.27s on a formula simplification. DAG size of input: 107 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:52:14,617 WARN L234 SmtUtils]: Spent 14.62s on a formula simplification. DAG size of input: 134 DAG size of output: 105 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:52:23,660 WARN L234 SmtUtils]: Spent 8.33s on a formula simplification. DAG size of input: 98 DAG size of output: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:52:34,421 WARN L234 SmtUtils]: Spent 8.40s on a formula simplification. DAG size of input: 96 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:52:43,288 WARN L234 SmtUtils]: Spent 8.36s on a formula simplification. DAG size of input: 89 DAG size of output: 64 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:52:53,326 WARN L234 SmtUtils]: Spent 8.43s on a formula simplification. DAG size of input: 105 DAG size of output: 84 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:53:08,314 WARN L234 SmtUtils]: Spent 14.62s on a formula simplification. DAG size of input: 130 DAG size of output: 91 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-08-26 10:53:20,244 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 10:53:20,244 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 10:53:20,566 WARN L266 SmtUtils]: Removed 11 from assertion stack [2023-08-26 10:53:20,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2023-08-26 10:53:20,567 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23ASSERT_VIOLATIONASSERT (125 of 126 remaining) [2023-08-26 10:53:20,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 10:53:20,768 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,SelfDestructingSolverStorable13 [2023-08-26 10:53:20,768 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. [2023-08-26 10:53:20,770 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (124 of 126 remaining) [2023-08-26 10:53:20,770 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (123 of 126 remaining) [2023-08-26 10:53:20,770 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (122 of 126 remaining) [2023-08-26 10:53:20,770 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (121 of 126 remaining) [2023-08-26 10:53:20,770 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (120 of 126 remaining) [2023-08-26 10:53:20,770 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (119 of 126 remaining) [2023-08-26 10:53:20,770 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (118 of 126 remaining) [2023-08-26 10:53:20,770 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (117 of 126 remaining) [2023-08-26 10:53:20,771 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONDATA_RACE (116 of 126 remaining) [2023-08-26 10:53:20,771 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONDATA_RACE (115 of 126 remaining) [2023-08-26 10:53:20,771 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (114 of 126 remaining) [2023-08-26 10:53:20,771 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (113 of 126 remaining) [2023-08-26 10:53:20,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (112 of 126 remaining) [2023-08-26 10:53:20,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (111 of 126 remaining) [2023-08-26 10:53:20,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (110 of 126 remaining) [2023-08-26 10:53:20,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (109 of 126 remaining) [2023-08-26 10:53:20,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (108 of 126 remaining) [2023-08-26 10:53:20,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (107 of 126 remaining) [2023-08-26 10:53:20,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONDATA_RACE (106 of 126 remaining) [2023-08-26 10:53:20,774 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONDATA_RACE (105 of 126 remaining) [2023-08-26 10:53:20,774 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONDATA_RACE (104 of 126 remaining) [2023-08-26 10:53:20,775 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONDATA_RACE (103 of 126 remaining) [2023-08-26 10:53:20,775 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONDATA_RACE (102 of 126 remaining) [2023-08-26 10:53:20,775 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONDATA_RACE (101 of 126 remaining) [2023-08-26 10:53:20,776 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14ASSERT_VIOLATIONDATA_RACE (100 of 126 remaining) [2023-08-26 10:53:20,776 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15ASSERT_VIOLATIONDATA_RACE (99 of 126 remaining) [2023-08-26 10:53:20,776 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err16ASSERT_VIOLATIONDATA_RACE (98 of 126 remaining) [2023-08-26 10:53:20,776 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err17ASSERT_VIOLATIONDATA_RACE (97 of 126 remaining) [2023-08-26 10:53:20,777 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err18ASSERT_VIOLATIONDATA_RACE (96 of 126 remaining) [2023-08-26 10:53:20,777 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err19ASSERT_VIOLATIONDATA_RACE (95 of 126 remaining) [2023-08-26 10:53:20,777 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err20ASSERT_VIOLATIONDATA_RACE (94 of 126 remaining) [2023-08-26 10:53:20,777 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err21ASSERT_VIOLATIONDATA_RACE (93 of 126 remaining) [2023-08-26 10:53:20,777 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (92 of 126 remaining) [2023-08-26 10:53:20,777 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (91 of 126 remaining) [2023-08-26 10:53:20,777 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (90 of 126 remaining) [2023-08-26 10:53:20,777 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (89 of 126 remaining) [2023-08-26 10:53:20,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (88 of 126 remaining) [2023-08-26 10:53:20,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (87 of 126 remaining) [2023-08-26 10:53:20,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err6ASSERT_VIOLATIONDATA_RACE (86 of 126 remaining) [2023-08-26 10:53:20,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err7ASSERT_VIOLATIONDATA_RACE (85 of 126 remaining) [2023-08-26 10:53:20,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err8ASSERT_VIOLATIONDATA_RACE (84 of 126 remaining) [2023-08-26 10:53:20,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err9ASSERT_VIOLATIONDATA_RACE (83 of 126 remaining) [2023-08-26 10:53:20,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err10ASSERT_VIOLATIONDATA_RACE (82 of 126 remaining) [2023-08-26 10:53:20,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err11ASSERT_VIOLATIONDATA_RACE (81 of 126 remaining) [2023-08-26 10:53:20,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err12ASSERT_VIOLATIONDATA_RACE (80 of 126 remaining) [2023-08-26 10:53:20,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err13ASSERT_VIOLATIONDATA_RACE (79 of 126 remaining) [2023-08-26 10:53:20,778 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (78 of 126 remaining) [2023-08-26 10:53:20,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (77 of 126 remaining) [2023-08-26 10:53:20,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (76 of 126 remaining) [2023-08-26 10:53:20,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (75 of 126 remaining) [2023-08-26 10:53:20,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (74 of 126 remaining) [2023-08-26 10:53:20,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (73 of 126 remaining) [2023-08-26 10:53:20,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (72 of 126 remaining) [2023-08-26 10:53:20,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (71 of 126 remaining) [2023-08-26 10:53:20,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (70 of 126 remaining) [2023-08-26 10:53:20,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (69 of 126 remaining) [2023-08-26 10:53:20,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (68 of 126 remaining) [2023-08-26 10:53:20,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (67 of 126 remaining) [2023-08-26 10:53:20,780 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (66 of 126 remaining) [2023-08-26 10:53:20,780 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (65 of 126 remaining) [2023-08-26 10:53:20,780 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (64 of 126 remaining) [2023-08-26 10:53:20,780 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (63 of 126 remaining) [2023-08-26 10:53:20,780 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (62 of 126 remaining) [2023-08-26 10:53:20,780 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (61 of 126 remaining) [2023-08-26 10:53:20,780 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (60 of 126 remaining) [2023-08-26 10:53:20,780 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (59 of 126 remaining) [2023-08-26 10:53:20,780 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (58 of 126 remaining) [2023-08-26 10:53:20,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (57 of 126 remaining) [2023-08-26 10:53:20,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (56 of 126 remaining) [2023-08-26 10:53:20,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 126 remaining) [2023-08-26 10:53:20,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (54 of 126 remaining) [2023-08-26 10:53:20,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (53 of 126 remaining) [2023-08-26 10:53:20,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 126 remaining) [2023-08-26 10:53:20,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err0ASSERT_VIOLATIONDATA_RACE (51 of 126 remaining) [2023-08-26 10:53:20,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err1ASSERT_VIOLATIONDATA_RACE (50 of 126 remaining) [2023-08-26 10:53:20,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err2ASSERT_VIOLATIONDATA_RACE (49 of 126 remaining) [2023-08-26 10:53:20,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (48 of 126 remaining) [2023-08-26 10:53:20,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (47 of 126 remaining) [2023-08-26 10:53:20,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (46 of 126 remaining) [2023-08-26 10:53:20,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (45 of 126 remaining) [2023-08-26 10:53:20,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (44 of 126 remaining) [2023-08-26 10:53:20,782 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (43 of 126 remaining) [2023-08-26 10:53:20,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (42 of 126 remaining) [2023-08-26 10:53:20,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (41 of 126 remaining) [2023-08-26 10:53:20,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONDATA_RACE (40 of 126 remaining) [2023-08-26 10:53:20,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONDATA_RACE (39 of 126 remaining) [2023-08-26 10:53:20,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (38 of 126 remaining) [2023-08-26 10:53:20,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (37 of 126 remaining) [2023-08-26 10:53:20,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (36 of 126 remaining) [2023-08-26 10:53:20,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (35 of 126 remaining) [2023-08-26 10:53:20,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (34 of 126 remaining) [2023-08-26 10:53:20,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (33 of 126 remaining) [2023-08-26 10:53:20,783 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (32 of 126 remaining) [2023-08-26 10:53:20,784 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (31 of 126 remaining) [2023-08-26 10:53:20,784 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONDATA_RACE (30 of 126 remaining) [2023-08-26 10:53:20,784 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONDATA_RACE (29 of 126 remaining) [2023-08-26 10:53:20,784 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONDATA_RACE (28 of 126 remaining) [2023-08-26 10:53:20,784 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONDATA_RACE (27 of 126 remaining) [2023-08-26 10:53:20,784 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONDATA_RACE (26 of 126 remaining) [2023-08-26 10:53:20,784 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONDATA_RACE (25 of 126 remaining) [2023-08-26 10:53:20,784 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14ASSERT_VIOLATIONDATA_RACE (24 of 126 remaining) [2023-08-26 10:53:20,784 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15ASSERT_VIOLATIONDATA_RACE (23 of 126 remaining) [2023-08-26 10:53:20,784 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err16ASSERT_VIOLATIONDATA_RACE (22 of 126 remaining) [2023-08-26 10:53:20,785 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err17ASSERT_VIOLATIONDATA_RACE (21 of 126 remaining) [2023-08-26 10:53:20,785 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err18ASSERT_VIOLATIONDATA_RACE (20 of 126 remaining) [2023-08-26 10:53:20,785 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err19ASSERT_VIOLATIONDATA_RACE (19 of 126 remaining) [2023-08-26 10:53:20,785 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err20ASSERT_VIOLATIONDATA_RACE (18 of 126 remaining) [2023-08-26 10:53:20,785 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err21ASSERT_VIOLATIONDATA_RACE (17 of 126 remaining) [2023-08-26 10:53:20,785 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (16 of 126 remaining) [2023-08-26 10:53:20,785 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (15 of 126 remaining) [2023-08-26 10:53:20,785 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (14 of 126 remaining) [2023-08-26 10:53:20,785 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (13 of 126 remaining) [2023-08-26 10:53:20,785 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (12 of 126 remaining) [2023-08-26 10:53:20,785 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (11 of 126 remaining) [2023-08-26 10:53:20,786 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err6ASSERT_VIOLATIONDATA_RACE (10 of 126 remaining) [2023-08-26 10:53:20,786 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err7ASSERT_VIOLATIONDATA_RACE (9 of 126 remaining) [2023-08-26 10:53:20,786 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 126 remaining) [2023-08-26 10:53:20,786 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err9ASSERT_VIOLATIONDATA_RACE (7 of 126 remaining) [2023-08-26 10:53:20,786 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err10ASSERT_VIOLATIONDATA_RACE (6 of 126 remaining) [2023-08-26 10:53:20,786 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err11ASSERT_VIOLATIONDATA_RACE (5 of 126 remaining) [2023-08-26 10:53:20,786 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err12ASSERT_VIOLATIONDATA_RACE (4 of 126 remaining) [2023-08-26 10:53:20,786 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err13ASSERT_VIOLATIONDATA_RACE (3 of 126 remaining) [2023-08-26 10:53:20,786 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err0ASSERT_VIOLATIONDATA_RACE (2 of 126 remaining) [2023-08-26 10:53:20,786 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 126 remaining) [2023-08-26 10:53:20,786 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err2ASSERT_VIOLATIONDATA_RACE (0 of 126 remaining) [2023-08-26 10:53:20,787 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:53:20,797 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 10:53:20,797 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 10:53:20,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 10:53:20 BasicIcfg [2023-08-26 10:53:20,800 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 10:53:20,800 INFO L158 Benchmark]: Toolchain (without parser) took 836235.82ms. Allocated memory was 396.4MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 372.5MB in the beginning and 835.6MB in the end (delta: -463.2MB). Peak memory consumption was 739.3MB. Max. memory is 16.0GB. [2023-08-26 10:53:20,800 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 396.4MB. Free memory is still 372.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 10:53:20,801 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.49ms. Allocated memory is still 396.4MB. Free memory was 372.3MB in the beginning and 358.5MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-08-26 10:53:20,801 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.11ms. Allocated memory is still 396.4MB. Free memory was 358.5MB in the beginning and 355.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 10:53:20,801 INFO L158 Benchmark]: Boogie Preprocessor took 76.63ms. Allocated memory is still 396.4MB. Free memory was 355.0MB in the beginning and 351.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 10:53:20,801 INFO L158 Benchmark]: RCFGBuilder took 1256.35ms. Allocated memory is still 396.4MB. Free memory was 351.8MB in the beginning and 286.7MB in the end (delta: 65.1MB). Peak memory consumption was 66.7MB. Max. memory is 16.0GB. [2023-08-26 10:53:20,801 INFO L158 Benchmark]: TraceAbstraction took 834475.34ms. Allocated memory was 396.4MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 285.6MB in the beginning and 835.6MB in the end (delta: -550.0MB). Peak memory consumption was 649.6MB. Max. memory is 16.0GB. [2023-08-26 10:53:20,802 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 396.4MB. Free memory is still 372.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 347.49ms. Allocated memory is still 396.4MB. Free memory was 372.3MB in the beginning and 358.5MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 74.11ms. Allocated memory is still 396.4MB. Free memory was 358.5MB in the beginning and 355.0MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 76.63ms. Allocated memory is still 396.4MB. Free memory was 355.0MB in the beginning and 351.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1256.35ms. Allocated memory is still 396.4MB. Free memory was 351.8MB in the beginning and 286.7MB in the end (delta: 65.1MB). Peak memory consumption was 66.7MB. Max. memory is 16.0GB. * TraceAbstraction took 834475.34ms. Allocated memory was 396.4MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 285.6MB in the beginning and 835.6MB in the end (delta: -550.0MB). Peak memory consumption was 649.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.8s, 371 PlacesBefore, 129 PlacesAfterwards, 376 TransitionsBefore, 121 TransitionsAfterwards, 10944 CoEnabledTransitionPairs, 9 FixpointIterations, 268 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 27 TrivialYvCompositions, 8 ConcurrentYvCompositions, 13 ChoiceCompositions, 396 TotalNumberOfCompositions, 62603 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24514, independent: 23598, independent conditional: 0, independent unconditional: 23598, dependent: 916, dependent conditional: 0, dependent unconditional: 916, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4700, independent: 4588, independent conditional: 0, independent unconditional: 4588, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 24514, independent: 19010, independent conditional: 0, independent unconditional: 19010, dependent: 804, dependent conditional: 0, dependent unconditional: 804, unknown: 4700, unknown conditional: 0, unknown unconditional: 4700] , Statistics on independence cache: Total cache size (in pairs): 1336, Positive cache size: 1266, Positive conditional cache size: 0, Positive unconditional cache size: 1266, Negative cache size: 70, Negative conditional cache size: 0, Negative unconditional cache size: 70, 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 PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 56]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 56]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 56]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 77]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 77]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 77]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 79]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 79]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 125]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 126]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 128]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 129]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 130]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 131]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 131]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 132]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 132]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 133]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 134]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 134]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 161]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 135]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 135]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 161]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 137]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 145]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 146]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 147]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 149]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 141]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 140]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 142]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 143]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 127 for 10411ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 466 locations, 126 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: 834.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 799.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.9s, HoareTripleCheckerStatistics: 2025 mSolverCounterUnknown, 6313 SdHoareTripleChecker+Valid, 395.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6313 mSDsluCounter, 5395 SdHoareTripleChecker+Invalid, 390.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5195 mSDsCounter, 531 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16668 IncrementalHoareTripleChecker+Invalid, 19224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 531 mSolverCounterUnsat, 200 mSDtfsCounter, 16668 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 2025 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 614 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 465 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38152 ImplicationChecksByTransitivity, 380.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6919occurred in iteration=13, InterpolantAutomatonStates: 321, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 567 NumberOfCodeBlocks, 567 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 647 ConstructedInterpolants, 23 QuantifiedInterpolants, 9301 SizeOfPredicates, 72 NumberOfNonLiveVariables, 1124 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 18/40 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