/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/goblint-regression/06-symbeq_08-tricky_address3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 07:02:23,643 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 07:02:23,729 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 07:02:23,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 07:02:23,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 07:02:23,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 07:02:23,775 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 07:02:23,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 07:02:23,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 07:02:23,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 07:02:23,784 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 07:02:23,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 07:02:23,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 07:02:23,785 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 07:02:23,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 07:02:23,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 07:02:23,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 07:02:23,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 07:02:23,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 07:02:23,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 07:02:23,787 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 07:02:23,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 07:02:23,788 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 07:02:23,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 07:02:23,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 07:02:23,789 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 07:02:23,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 07:02:23,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 07:02:23,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 07:02:23,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 07:02:23,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 07:02:23,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 07:02:23,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 07:02:23,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 07:02:23,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 07:02:23,791 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 07:02:24,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 07:02:24,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 07:02:24,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 07:02:24,136 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 07:02:24,138 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 07:02:24,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_08-tricky_address3.i [2023-08-26 07:02:25,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 07:02:25,604 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 07:02:25,604 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_08-tricky_address3.i [2023-08-26 07:02:25,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd53b874a/a666fa6ff9af486899a92fe4daff47d5/FLAG61b3d083e [2023-08-26 07:02:25,642 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd53b874a/a666fa6ff9af486899a92fe4daff47d5 [2023-08-26 07:02:25,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 07:02:25,649 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 07:02:25,651 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 07:02:25,651 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 07:02:25,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 07:02:25,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:02:25" (1/1) ... [2023-08-26 07:02:25,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37a39a01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:02:25, skipping insertion in model container [2023-08-26 07:02:25,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:02:25" (1/1) ... [2023-08-26 07:02:25,701 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 07:02:26,094 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 07:02:26,108 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 07:02:26,122 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [249] [2023-08-26 07:02:26,124 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [249] [2023-08-26 07:02:26,140 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [741] [2023-08-26 07:02:26,162 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 07:02:26,209 INFO L206 MainTranslator]: Completed translation [2023-08-26 07:02:26,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:02:26 WrapperNode [2023-08-26 07:02:26,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 07:02:26,211 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 07:02:26,211 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 07:02:26,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 07:02:26,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:02:26" (1/1) ... [2023-08-26 07:02:26,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:02:26" (1/1) ... [2023-08-26 07:02:26,255 INFO L138 Inliner]: procedures = 264, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 94 [2023-08-26 07:02:26,255 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 07:02:26,256 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 07:02:26,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 07:02:26,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 07:02:26,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:02:26" (1/1) ... [2023-08-26 07:02:26,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:02:26" (1/1) ... [2023-08-26 07:02:26,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:02:26" (1/1) ... [2023-08-26 07:02:26,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:02:26" (1/1) ... [2023-08-26 07:02:26,276 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:02:26" (1/1) ... [2023-08-26 07:02:26,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:02:26" (1/1) ... [2023-08-26 07:02:26,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:02:26" (1/1) ... [2023-08-26 07:02:26,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:02:26" (1/1) ... [2023-08-26 07:02:26,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 07:02:26,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 07:02:26,285 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 07:02:26,285 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 07:02:26,285 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:02:26" (1/1) ... [2023-08-26 07:02:26,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 07:02:26,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:02:26,318 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 07:02:26,320 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 07:02:26,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 07:02:26,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 07:02:26,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 07:02:26,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 07:02:26,348 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 07:02:26,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 07:02:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-26 07:02:26,349 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-26 07:02:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 07:02:26,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 07:02:26,350 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 07:02:26,461 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 07:02:26,463 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 07:02:26,646 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 07:02:26,652 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 07:02:26,652 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-26 07:02:26,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:02:26 BoogieIcfgContainer [2023-08-26 07:02:26,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 07:02:26,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 07:02:26,656 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 07:02:26,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 07:02:26,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 07:02:25" (1/3) ... [2023-08-26 07:02:26,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a53406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:02:26, skipping insertion in model container [2023-08-26 07:02:26,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:02:26" (2/3) ... [2023-08-26 07:02:26,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13a53406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:02:26, skipping insertion in model container [2023-08-26 07:02:26,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:02:26" (3/3) ... [2023-08-26 07:02:26,661 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_08-tricky_address3.i [2023-08-26 07:02:26,676 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 07:02:26,676 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-08-26 07:02:26,676 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 07:02:26,749 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 07:02:26,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 102 transitions, 209 flow [2023-08-26 07:02:26,847 INFO L124 PetriNetUnfolderBase]: 4/101 cut-off events. [2023-08-26 07:02:26,847 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 07:02:26,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 101 events. 4/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-26 07:02:26,854 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 102 transitions, 209 flow [2023-08-26 07:02:26,859 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 101 transitions, 205 flow [2023-08-26 07:02:26,864 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 07:02:26,875 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 101 transitions, 205 flow [2023-08-26 07:02:26,879 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 101 transitions, 205 flow [2023-08-26 07:02:26,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 101 transitions, 205 flow [2023-08-26 07:02:26,915 INFO L124 PetriNetUnfolderBase]: 4/101 cut-off events. [2023-08-26 07:02:26,915 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 07:02:26,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 101 events. 4/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-26 07:02:26,918 INFO L119 LiptonReduction]: Number of co-enabled transitions 2262 [2023-08-26 07:02:28,825 INFO L134 LiptonReduction]: Checked pairs total: 8906 [2023-08-26 07:02:28,825 INFO L136 LiptonReduction]: Total number of compositions: 75 [2023-08-26 07:02:28,837 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 07:02:28,842 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;@a029cec, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 07:02:28,842 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-26 07:02:28,847 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 07:02:28,847 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2023-08-26 07:02:28,847 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 07:02:28,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:02:28,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:02:28,848 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-26 07:02:28,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:02:28,852 INFO L85 PathProgramCache]: Analyzing trace with hash 711355281, now seen corresponding path program 1 times [2023-08-26 07:02:28,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:02:28,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786572020] [2023-08-26 07:02:28,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:02:28,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:02:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:02:29,108 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 07:02:29,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:02:29,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786572020] [2023-08-26 07:02:29,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786572020] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:02:29,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:02:29,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 07:02:29,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438721607] [2023-08-26 07:02:29,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:02:29,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 07:02:29,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:02:29,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 07:02:29,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 07:02:29,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 177 [2023-08-26 07:02:29,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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 07:02:29,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:02:29,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 177 [2023-08-26 07:02:29,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:02:29,223 INFO L124 PetriNetUnfolderBase]: 37/165 cut-off events. [2023-08-26 07:02:29,224 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 07:02:29,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 165 events. 37/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 625 event pairs, 36 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 244. Up to 89 conditions per place. [2023-08-26 07:02:29,226 INFO L140 encePairwiseOnDemand]: 174/177 looper letters, 15 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-08-26 07:02:29,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 111 flow [2023-08-26 07:02:29,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 07:02:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 07:02:29,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2023-08-26 07:02:29,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5423728813559322 [2023-08-26 07:02:29,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 288 transitions. [2023-08-26 07:02:29,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 288 transitions. [2023-08-26 07:02:29,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:02:29,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 288 transitions. [2023-08-26 07:02:29,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states 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 07:02:29,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:02:29,259 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:02:29,260 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 75 flow. Second operand 3 states and 288 transitions. [2023-08-26 07:02:29,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 111 flow [2023-08-26 07:02:29,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 07:02:29,264 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 86 flow [2023-08-26 07:02:29,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-08-26 07:02:29,269 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2023-08-26 07:02:29,269 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 86 flow [2023-08-26 07:02:29,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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 07:02:29,270 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:02:29,270 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:02:29,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 07:02:29,270 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-26 07:02:29,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:02:29,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1960432891, now seen corresponding path program 1 times [2023-08-26 07:02:29,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:02:29,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995838170] [2023-08-26 07:02:29,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:02:29,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:02:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:02:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:02:29,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:02:29,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995838170] [2023-08-26 07:02:29,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995838170] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:02:29,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25136696] [2023-08-26 07:02:29,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:02:29,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:02:29,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:02:29,417 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 07:02:29,423 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 07:02:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:02:29,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 07:02:29,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:02:29,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:02:29,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:02:29,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:02:29,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25136696] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:02:29,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:02:29,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 07:02:29,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869806110] [2023-08-26 07:02:29,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:02:29,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 07:02:29,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:02:29,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 07:02:29,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 07:02:29,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 177 [2023-08-26 07:02:29,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 91.57142857142857) internal successors, (641), 7 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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 07:02:29,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:02:29,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 177 [2023-08-26 07:02:29,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:02:29,599 INFO L124 PetriNetUnfolderBase]: 37/168 cut-off events. [2023-08-26 07:02:29,599 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 07:02:29,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 168 events. 37/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 623 event pairs, 36 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 263. Up to 89 conditions per place. [2023-08-26 07:02:29,600 INFO L140 encePairwiseOnDemand]: 174/177 looper letters, 15 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2023-08-26 07:02:29,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 138 flow [2023-08-26 07:02:29,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:02:29,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:02:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 563 transitions. [2023-08-26 07:02:29,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5301318267419962 [2023-08-26 07:02:29,605 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 563 transitions. [2023-08-26 07:02:29,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 563 transitions. [2023-08-26 07:02:29,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:02:29,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 563 transitions. [2023-08-26 07:02:29,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states 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 07:02:29,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:02:29,610 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:02:29,610 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 86 flow. Second operand 6 states and 563 transitions. [2023-08-26 07:02:29,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 138 flow [2023-08-26 07:02:29,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 134 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 07:02:29,612 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 118 flow [2023-08-26 07:02:29,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-26 07:02:29,613 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-08-26 07:02:29,613 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 118 flow [2023-08-26 07:02:29,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.57142857142857) internal successors, (641), 7 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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 07:02:29,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:02:29,614 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:02:29,623 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 07:02:29,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:02:29,821 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-26 07:02:29,822 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:02:29,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1754673354, now seen corresponding path program 2 times [2023-08-26 07:02:29,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:02:29,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971711720] [2023-08-26 07:02:29,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:02:29,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:02:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:02:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 07:02:30,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:02:30,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971711720] [2023-08-26 07:02:30,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971711720] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:02:30,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:02:30,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:02:30,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131004223] [2023-08-26 07:02:30,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:02:30,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:02:30,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:02:30,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:02:30,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 07:02:30,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 177 [2023-08-26 07:02:30,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 118 flow. Second operand has 6 states, 6 states have (on average 70.83333333333333) internal successors, (425), 6 states have internal predecessors, (425), 0 states have call successors, (0), 0 states 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 07:02:30,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:02:30,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 177 [2023-08-26 07:02:30,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:02:30,545 INFO L124 PetriNetUnfolderBase]: 268/583 cut-off events. [2023-08-26 07:02:30,545 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 07:02:30,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1189 conditions, 583 events. 268/583 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2482 event pairs, 138 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 1156. Up to 411 conditions per place. [2023-08-26 07:02:30,554 INFO L140 encePairwiseOnDemand]: 166/177 looper letters, 83 selfloop transitions, 22 changer transitions 0/106 dead transitions. [2023-08-26 07:02:30,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 106 transitions, 460 flow [2023-08-26 07:02:30,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:02:30,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:02:30,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 516 transitions. [2023-08-26 07:02:30,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4858757062146893 [2023-08-26 07:02:30,560 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 516 transitions. [2023-08-26 07:02:30,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 516 transitions. [2023-08-26 07:02:30,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:02:30,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 516 transitions. [2023-08-26 07:02:30,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 86.0) internal successors, (516), 6 states have internal predecessors, (516), 0 states have call successors, (0), 0 states 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 07:02:30,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:02:30,566 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:02:30,566 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 118 flow. Second operand 6 states and 516 transitions. [2023-08-26 07:02:30,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 106 transitions, 460 flow [2023-08-26 07:02:30,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 106 transitions, 446 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 07:02:30,570 INFO L231 Difference]: Finished difference. Result has 57 places, 61 transitions, 254 flow [2023-08-26 07:02:30,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=254, PETRI_PLACES=57, PETRI_TRANSITIONS=61} [2023-08-26 07:02:30,572 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2023-08-26 07:02:30,572 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 254 flow [2023-08-26 07:02:30,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.83333333333333) internal successors, (425), 6 states have internal predecessors, (425), 0 states have call successors, (0), 0 states 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 07:02:30,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:02:30,572 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:02:30,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 07:02:30,573 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-26 07:02:30,574 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:02:30,574 INFO L85 PathProgramCache]: Analyzing trace with hash -364685487, now seen corresponding path program 1 times [2023-08-26 07:02:30,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:02:30,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450358776] [2023-08-26 07:02:30,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:02:30,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:02:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:02:30,847 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 07:02:30,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:02:30,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450358776] [2023-08-26 07:02:30,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450358776] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:02:30,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:02:30,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:02:30,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508573204] [2023-08-26 07:02:30,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:02:30,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:02:30,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:02:30,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:02:30,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 07:02:30,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 177 [2023-08-26 07:02:30,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 61 transitions, 254 flow. Second operand has 6 states, 6 states have (on average 64.83333333333333) internal successors, (389), 6 states have internal predecessors, (389), 0 states have call successors, (0), 0 states 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 07:02:30,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:02:30,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 177 [2023-08-26 07:02:30,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:02:31,103 INFO L124 PetriNetUnfolderBase]: 310/670 cut-off events. [2023-08-26 07:02:31,103 INFO L125 PetriNetUnfolderBase]: For 243/243 co-relation queries the response was YES. [2023-08-26 07:02:31,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1706 conditions, 670 events. 310/670 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2956 event pairs, 124 based on Foata normal form. 0/617 useless extension candidates. Maximal degree in co-relation 1675. Up to 502 conditions per place. [2023-08-26 07:02:31,108 INFO L140 encePairwiseOnDemand]: 166/177 looper letters, 101 selfloop transitions, 26 changer transitions 0/127 dead transitions. [2023-08-26 07:02:31,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 127 transitions, 730 flow [2023-08-26 07:02:31,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:02:31,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:02:31,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 481 transitions. [2023-08-26 07:02:31,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529190207156309 [2023-08-26 07:02:31,110 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 481 transitions. [2023-08-26 07:02:31,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 481 transitions. [2023-08-26 07:02:31,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:02:31,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 481 transitions. [2023-08-26 07:02:31,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states 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 07:02:31,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:02:31,114 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:02:31,114 INFO L175 Difference]: Start difference. First operand has 57 places, 61 transitions, 254 flow. Second operand 6 states and 481 transitions. [2023-08-26 07:02:31,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 127 transitions, 730 flow [2023-08-26 07:02:31,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 127 transitions, 730 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 07:02:31,119 INFO L231 Difference]: Finished difference. Result has 67 places, 82 transitions, 438 flow [2023-08-26 07:02:31,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=438, PETRI_PLACES=67, PETRI_TRANSITIONS=82} [2023-08-26 07:02:31,120 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 28 predicate places. [2023-08-26 07:02:31,120 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 82 transitions, 438 flow [2023-08-26 07:02:31,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.83333333333333) internal successors, (389), 6 states have internal predecessors, (389), 0 states have call successors, (0), 0 states 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 07:02:31,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:02:31,120 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:02:31,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 07:02:31,121 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-26 07:02:31,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:02:31,121 INFO L85 PathProgramCache]: Analyzing trace with hash 129294706, now seen corresponding path program 1 times [2023-08-26 07:02:31,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:02:31,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812455059] [2023-08-26 07:02:31,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:02:31,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:02:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:02:31,196 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:02:31,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:02:31,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812455059] [2023-08-26 07:02:31,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812455059] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:02:31,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966301709] [2023-08-26 07:02:31,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:02:31,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:02:31,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:02:31,199 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 07:02:31,225 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 07:02:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:02:31,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 07:02:31,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:02:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:02:31,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:02:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:02:31,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966301709] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:02:31,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:02:31,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-08-26 07:02:31,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312739366] [2023-08-26 07:02:31,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:02:31,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 07:02:31,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:02:31,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 07:02:31,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-08-26 07:02:31,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 177 [2023-08-26 07:02:31,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 82 transitions, 438 flow. Second operand has 12 states, 12 states have (on average 91.41666666666667) internal successors, (1097), 12 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states 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 07:02:31,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:02:31,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 177 [2023-08-26 07:02:31,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:02:31,454 INFO L124 PetriNetUnfolderBase]: 121/375 cut-off events. [2023-08-26 07:02:31,455 INFO L125 PetriNetUnfolderBase]: For 310/317 co-relation queries the response was YES. [2023-08-26 07:02:31,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 375 events. 121/375 cut-off events. For 310/317 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1838 event pairs, 43 based on Foata normal form. 6/374 useless extension candidates. Maximal degree in co-relation 933. Up to 154 conditions per place. [2023-08-26 07:02:31,458 INFO L140 encePairwiseOnDemand]: 174/177 looper letters, 26 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2023-08-26 07:02:31,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 88 transitions, 548 flow [2023-08-26 07:02:31,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 07:02:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 07:02:31,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1112 transitions. [2023-08-26 07:02:31,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5235404896421846 [2023-08-26 07:02:31,462 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1112 transitions. [2023-08-26 07:02:31,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1112 transitions. [2023-08-26 07:02:31,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:02:31,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1112 transitions. [2023-08-26 07:02:31,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 92.66666666666667) internal successors, (1112), 12 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states 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 07:02:31,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 177.0) internal successors, (2301), 13 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states 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 07:02:31,469 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 177.0) internal successors, (2301), 13 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states 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 07:02:31,469 INFO L175 Difference]: Start difference. First operand has 67 places, 82 transitions, 438 flow. Second operand 12 states and 1112 transitions. [2023-08-26 07:02:31,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 88 transitions, 548 flow [2023-08-26 07:02:31,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 88 transitions, 548 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 07:02:31,474 INFO L231 Difference]: Finished difference. Result has 84 places, 88 transitions, 522 flow [2023-08-26 07:02:31,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=522, PETRI_PLACES=84, PETRI_TRANSITIONS=88} [2023-08-26 07:02:31,475 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 45 predicate places. [2023-08-26 07:02:31,475 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 522 flow [2023-08-26 07:02:31,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 91.41666666666667) internal successors, (1097), 12 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states 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 07:02:31,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:02:31,476 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:02:31,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-26 07:02:31,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:02:31,682 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-26 07:02:31,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:02:31,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1012549394, now seen corresponding path program 2 times [2023-08-26 07:02:31,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:02:31,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323615101] [2023-08-26 07:02:31,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:02:31,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:02:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:02:32,058 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:02:32,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:02:32,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323615101] [2023-08-26 07:02:32,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323615101] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:02:32,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:02:32,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:02:32,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42427763] [2023-08-26 07:02:32,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:02:32,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:02:32,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:02:32,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:02:32,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 07:02:32,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 177 [2023-08-26 07:02:32,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 88 transitions, 522 flow. Second operand has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 0 states have call successors, (0), 0 states 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 07:02:32,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:02:32,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 177 [2023-08-26 07:02:32,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:02:32,328 INFO L124 PetriNetUnfolderBase]: 351/780 cut-off events. [2023-08-26 07:02:32,329 INFO L125 PetriNetUnfolderBase]: For 609/609 co-relation queries the response was YES. [2023-08-26 07:02:32,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2379 conditions, 780 events. 351/780 cut-off events. For 609/609 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3693 event pairs, 116 based on Foata normal form. 0/733 useless extension candidates. Maximal degree in co-relation 2294. Up to 618 conditions per place. [2023-08-26 07:02:32,334 INFO L140 encePairwiseOnDemand]: 162/177 looper letters, 102 selfloop transitions, 53 changer transitions 8/164 dead transitions. [2023-08-26 07:02:32,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 164 transitions, 1160 flow [2023-08-26 07:02:32,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:02:32,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:02:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 503 transitions. [2023-08-26 07:02:32,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4736346516007533 [2023-08-26 07:02:32,336 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 503 transitions. [2023-08-26 07:02:32,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 503 transitions. [2023-08-26 07:02:32,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:02:32,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 503 transitions. [2023-08-26 07:02:32,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 0 states have call successors, (0), 0 states 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 07:02:32,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:02:32,340 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:02:32,340 INFO L175 Difference]: Start difference. First operand has 84 places, 88 transitions, 522 flow. Second operand 6 states and 503 transitions. [2023-08-26 07:02:32,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 164 transitions, 1160 flow [2023-08-26 07:02:32,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 164 transitions, 1112 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-26 07:02:32,348 INFO L231 Difference]: Finished difference. Result has 89 places, 135 transitions, 956 flow [2023-08-26 07:02:32,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=956, PETRI_PLACES=89, PETRI_TRANSITIONS=135} [2023-08-26 07:02:32,350 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 50 predicate places. [2023-08-26 07:02:32,350 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 135 transitions, 956 flow [2023-08-26 07:02:32,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 0 states have call successors, (0), 0 states 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 07:02:32,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:02:32,351 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:02:32,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 07:02:32,351 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-26 07:02:32,351 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:02:32,351 INFO L85 PathProgramCache]: Analyzing trace with hash 89381196, now seen corresponding path program 1 times [2023-08-26 07:02:32,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:02:32,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910109516] [2023-08-26 07:02:32,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:02:32,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:02:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:02:32,677 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:02:32,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:02:32,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910109516] [2023-08-26 07:02:32,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910109516] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:02:32,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:02:32,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:02:32,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515837269] [2023-08-26 07:02:32,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:02:32,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:02:32,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:02:32,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:02:32,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 07:02:32,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 177 [2023-08-26 07:02:32,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 135 transitions, 956 flow. Second operand has 6 states, 6 states have (on average 63.833333333333336) internal successors, (383), 6 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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 07:02:32,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:02:32,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 177 [2023-08-26 07:02:32,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:02:33,020 INFO L124 PetriNetUnfolderBase]: 455/976 cut-off events. [2023-08-26 07:02:33,021 INFO L125 PetriNetUnfolderBase]: For 1337/1337 co-relation queries the response was YES. [2023-08-26 07:02:33,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3615 conditions, 976 events. 455/976 cut-off events. For 1337/1337 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4802 event pairs, 121 based on Foata normal form. 0/951 useless extension candidates. Maximal degree in co-relation 3550. Up to 789 conditions per place. [2023-08-26 07:02:33,027 INFO L140 encePairwiseOnDemand]: 162/177 looper letters, 142 selfloop transitions, 58 changer transitions 26/226 dead transitions. [2023-08-26 07:02:33,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 226 transitions, 1890 flow [2023-08-26 07:02:33,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:02:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:02:33,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 472 transitions. [2023-08-26 07:02:33,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-08-26 07:02:33,030 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 472 transitions. [2023-08-26 07:02:33,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 472 transitions. [2023-08-26 07:02:33,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:02:33,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 472 transitions. [2023-08-26 07:02:33,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 0 states have call successors, (0), 0 states 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 07:02:33,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:02:33,034 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:02:33,034 INFO L175 Difference]: Start difference. First operand has 89 places, 135 transitions, 956 flow. Second operand 6 states and 472 transitions. [2023-08-26 07:02:33,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 226 transitions, 1890 flow [2023-08-26 07:02:33,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 226 transitions, 1826 flow, removed 32 selfloop flow, removed 0 redundant places. [2023-08-26 07:02:33,046 INFO L231 Difference]: Finished difference. Result has 99 places, 176 transitions, 1418 flow [2023-08-26 07:02:33,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1418, PETRI_PLACES=99, PETRI_TRANSITIONS=176} [2023-08-26 07:02:33,047 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 60 predicate places. [2023-08-26 07:02:33,047 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 176 transitions, 1418 flow [2023-08-26 07:02:33,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.833333333333336) internal successors, (383), 6 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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 07:02:33,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:02:33,047 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:02:33,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 07:02:33,048 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-26 07:02:33,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:02:33,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1125954593, now seen corresponding path program 1 times [2023-08-26 07:02:33,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:02:33,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575678322] [2023-08-26 07:02:33,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:02:33,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:02:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:02:34,595 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:02:34,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:02:34,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575678322] [2023-08-26 07:02:34,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575678322] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:02:34,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:02:34,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-26 07:02:34,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678556265] [2023-08-26 07:02:34,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:02:34,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 07:02:34,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:02:34,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 07:02:34,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2023-08-26 07:02:34,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 177 [2023-08-26 07:02:34,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 176 transitions, 1418 flow. Second operand has 10 states, 10 states have (on average 61.0) internal successors, (610), 10 states have internal predecessors, (610), 0 states have call successors, (0), 0 states 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 07:02:34,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:02:34,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 177 [2023-08-26 07:02:34,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:02:35,613 INFO L124 PetriNetUnfolderBase]: 863/1883 cut-off events. [2023-08-26 07:02:35,614 INFO L125 PetriNetUnfolderBase]: For 4267/4267 co-relation queries the response was YES. [2023-08-26 07:02:35,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8236 conditions, 1883 events. 863/1883 cut-off events. For 4267/4267 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11625 event pairs, 88 based on Foata normal form. 3/1886 useless extension candidates. Maximal degree in co-relation 8166. Up to 724 conditions per place. [2023-08-26 07:02:35,630 INFO L140 encePairwiseOnDemand]: 160/177 looper letters, 396 selfloop transitions, 73 changer transitions 33/502 dead transitions. [2023-08-26 07:02:35,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 502 transitions, 4848 flow [2023-08-26 07:02:35,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 07:02:35,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 07:02:35,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 839 transitions. [2023-08-26 07:02:35,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.430919363122753 [2023-08-26 07:02:35,634 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 839 transitions. [2023-08-26 07:02:35,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 839 transitions. [2023-08-26 07:02:35,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:02:35,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 839 transitions. [2023-08-26 07:02:35,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 76.27272727272727) internal successors, (839), 11 states have internal predecessors, (839), 0 states have call successors, (0), 0 states 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 07:02:35,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 177.0) internal successors, (2124), 12 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:02:35,640 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 177.0) internal successors, (2124), 12 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:02:35,641 INFO L175 Difference]: Start difference. First operand has 99 places, 176 transitions, 1418 flow. Second operand 11 states and 839 transitions. [2023-08-26 07:02:35,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 502 transitions, 4848 flow [2023-08-26 07:02:35,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 502 transitions, 4712 flow, removed 68 selfloop flow, removed 0 redundant places. [2023-08-26 07:02:35,676 INFO L231 Difference]: Finished difference. Result has 117 places, 238 transitions, 2264 flow [2023-08-26 07:02:35,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2264, PETRI_PLACES=117, PETRI_TRANSITIONS=238} [2023-08-26 07:02:35,679 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 78 predicate places. [2023-08-26 07:02:35,679 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 238 transitions, 2264 flow [2023-08-26 07:02:35,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 61.0) internal successors, (610), 10 states have internal predecessors, (610), 0 states have call successors, (0), 0 states 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 07:02:35,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:02:35,682 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:02:35,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 07:02:35,682 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-26 07:02:35,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:02:35,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1375344539, now seen corresponding path program 2 times [2023-08-26 07:02:35,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:02:35,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724192149] [2023-08-26 07:02:35,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:02:35,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:02:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:02:37,219 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:02:37,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:02:37,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724192149] [2023-08-26 07:02:37,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724192149] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:02:37,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:02:37,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-26 07:02:37,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003454603] [2023-08-26 07:02:37,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:02:37,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 07:02:37,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:02:37,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 07:02:37,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-08-26 07:02:37,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 177 [2023-08-26 07:02:37,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 238 transitions, 2264 flow. Second operand has 11 states, 11 states have (on average 60.81818181818182) internal successors, (669), 11 states have internal predecessors, (669), 0 states have call successors, (0), 0 states 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 07:02:37,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:02:37,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 177 [2023-08-26 07:02:37,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:02:38,312 INFO L124 PetriNetUnfolderBase]: 908/2005 cut-off events. [2023-08-26 07:02:38,312 INFO L125 PetriNetUnfolderBase]: For 6948/6948 co-relation queries the response was YES. [2023-08-26 07:02:38,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9917 conditions, 2005 events. 908/2005 cut-off events. For 6948/6948 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 12692 event pairs, 109 based on Foata normal form. 2/2007 useless extension candidates. Maximal degree in co-relation 9838. Up to 1250 conditions per place. [2023-08-26 07:02:38,335 INFO L140 encePairwiseOnDemand]: 161/177 looper letters, 250 selfloop transitions, 97 changer transitions 58/405 dead transitions. [2023-08-26 07:02:38,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 405 transitions, 4462 flow [2023-08-26 07:02:38,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 07:02:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 07:02:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 875 transitions. [2023-08-26 07:02:38,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4119585687382298 [2023-08-26 07:02:38,338 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 875 transitions. [2023-08-26 07:02:38,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 875 transitions. [2023-08-26 07:02:38,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:02:38,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 875 transitions. [2023-08-26 07:02:38,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 72.91666666666667) internal successors, (875), 12 states have internal predecessors, (875), 0 states have call successors, (0), 0 states 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 07:02:38,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 177.0) internal successors, (2301), 13 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states 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 07:02:38,344 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 177.0) internal successors, (2301), 13 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states 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 07:02:38,344 INFO L175 Difference]: Start difference. First operand has 117 places, 238 transitions, 2264 flow. Second operand 12 states and 875 transitions. [2023-08-26 07:02:38,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 405 transitions, 4462 flow [2023-08-26 07:02:38,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 405 transitions, 4454 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-26 07:02:38,421 INFO L231 Difference]: Finished difference. Result has 137 places, 264 transitions, 3059 flow [2023-08-26 07:02:38,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=2260, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3059, PETRI_PLACES=137, PETRI_TRANSITIONS=264} [2023-08-26 07:02:38,422 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 98 predicate places. [2023-08-26 07:02:38,422 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 264 transitions, 3059 flow [2023-08-26 07:02:38,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 60.81818181818182) internal successors, (669), 11 states have internal predecessors, (669), 0 states have call successors, (0), 0 states 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 07:02:38,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:02:38,423 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:02:38,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 07:02:38,423 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-26 07:02:38,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:02:38,424 INFO L85 PathProgramCache]: Analyzing trace with hash 906598757, now seen corresponding path program 3 times [2023-08-26 07:02:38,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:02:38,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815519122] [2023-08-26 07:02:38,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:02:38,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:02:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:02:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:02:39,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:02:39,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815519122] [2023-08-26 07:02:39,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815519122] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:02:39,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:02:39,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 07:02:39,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588380482] [2023-08-26 07:02:39,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:02:39,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 07:02:39,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:02:39,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 07:02:39,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-08-26 07:02:39,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 177 [2023-08-26 07:02:39,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 264 transitions, 3059 flow. Second operand has 9 states, 9 states have (on average 61.22222222222222) internal successors, (551), 9 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:02:39,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:02:39,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 177 [2023-08-26 07:02:39,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:02:39,896 INFO L124 PetriNetUnfolderBase]: 873/1949 cut-off events. [2023-08-26 07:02:39,896 INFO L125 PetriNetUnfolderBase]: For 10735/10735 co-relation queries the response was YES. [2023-08-26 07:02:39,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10736 conditions, 1949 events. 873/1949 cut-off events. For 10735/10735 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12375 event pairs, 89 based on Foata normal form. 2/1951 useless extension candidates. Maximal degree in co-relation 10648. Up to 782 conditions per place. [2023-08-26 07:02:39,923 INFO L140 encePairwiseOnDemand]: 162/177 looper letters, 363 selfloop transitions, 93 changer transitions 26/482 dead transitions. [2023-08-26 07:02:39,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 482 transitions, 5715 flow [2023-08-26 07:02:39,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 07:02:39,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 07:02:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 762 transitions. [2023-08-26 07:02:39,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43050847457627117 [2023-08-26 07:02:39,926 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 762 transitions. [2023-08-26 07:02:39,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 762 transitions. [2023-08-26 07:02:39,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:02:39,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 762 transitions. [2023-08-26 07:02:39,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 76.2) internal successors, (762), 10 states have internal predecessors, (762), 0 states have call successors, (0), 0 states 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 07:02:39,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 177.0) internal successors, (1947), 11 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states 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 07:02:39,931 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 177.0) internal successors, (1947), 11 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states 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 07:02:39,931 INFO L175 Difference]: Start difference. First operand has 137 places, 264 transitions, 3059 flow. Second operand 10 states and 762 transitions. [2023-08-26 07:02:39,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 482 transitions, 5715 flow [2023-08-26 07:02:39,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 482 transitions, 5621 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-08-26 07:02:40,000 INFO L231 Difference]: Finished difference. Result has 145 places, 288 transitions, 3557 flow [2023-08-26 07:02:40,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=2985, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3557, PETRI_PLACES=145, PETRI_TRANSITIONS=288} [2023-08-26 07:02:40,001 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 106 predicate places. [2023-08-26 07:02:40,001 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 288 transitions, 3557 flow [2023-08-26 07:02:40,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 61.22222222222222) internal successors, (551), 9 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:02:40,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:02:40,002 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:02:40,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 07:02:40,002 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-26 07:02:40,002 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:02:40,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1376095225, now seen corresponding path program 4 times [2023-08-26 07:02:40,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:02:40,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88003490] [2023-08-26 07:02:40,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:02:40,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:02:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:02:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:02:41,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:02:41,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88003490] [2023-08-26 07:02:41,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88003490] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:02:41,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:02:41,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 07:02:41,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79421964] [2023-08-26 07:02:41,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:02:41,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 07:02:41,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:02:41,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 07:02:41,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-26 07:02:41,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 177 [2023-08-26 07:02:41,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 288 transitions, 3557 flow. Second operand has 9 states, 9 states have (on average 61.22222222222222) internal successors, (551), 9 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:02:41,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:02:41,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 177 [2023-08-26 07:02:41,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:02:42,032 INFO L124 PetriNetUnfolderBase]: 951/2115 cut-off events. [2023-08-26 07:02:42,032 INFO L125 PetriNetUnfolderBase]: For 14237/14237 co-relation queries the response was YES. [2023-08-26 07:02:42,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12087 conditions, 2115 events. 951/2115 cut-off events. For 14237/14237 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 13662 event pairs, 127 based on Foata normal form. 16/2131 useless extension candidates. Maximal degree in co-relation 11994. Up to 1273 conditions per place. [2023-08-26 07:02:42,058 INFO L140 encePairwiseOnDemand]: 162/177 looper letters, 284 selfloop transitions, 125 changer transitions 27/436 dead transitions. [2023-08-26 07:02:42,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 436 transitions, 5867 flow [2023-08-26 07:02:42,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 07:02:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 07:02:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 689 transitions. [2023-08-26 07:02:42,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4325172630257376 [2023-08-26 07:02:42,061 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 689 transitions. [2023-08-26 07:02:42,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 689 transitions. [2023-08-26 07:02:42,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:02:42,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 689 transitions. [2023-08-26 07:02:42,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 76.55555555555556) internal successors, (689), 9 states have internal predecessors, (689), 0 states have call successors, (0), 0 states 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 07:02:42,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 177.0) internal successors, (1770), 10 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states 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 07:02:42,065 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 177.0) internal successors, (1770), 10 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states 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 07:02:42,065 INFO L175 Difference]: Start difference. First operand has 145 places, 288 transitions, 3557 flow. Second operand 9 states and 689 transitions. [2023-08-26 07:02:42,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 436 transitions, 5867 flow [2023-08-26 07:02:42,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 436 transitions, 5786 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-26 07:02:42,146 INFO L231 Difference]: Finished difference. Result has 155 places, 317 transitions, 4509 flow [2023-08-26 07:02:42,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=3502, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4509, PETRI_PLACES=155, PETRI_TRANSITIONS=317} [2023-08-26 07:02:42,147 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 116 predicate places. [2023-08-26 07:02:42,147 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 317 transitions, 4509 flow [2023-08-26 07:02:42,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 61.22222222222222) internal successors, (551), 9 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:02:42,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:02:42,148 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:02:42,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 07:02:42,148 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-26 07:02:42,148 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:02:42,148 INFO L85 PathProgramCache]: Analyzing trace with hash 367435628, now seen corresponding path program 1 times [2023-08-26 07:02:42,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:02:42,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198533408] [2023-08-26 07:02:42,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:02:42,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:02:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:02:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:02:45,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:02:45,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198533408] [2023-08-26 07:02:45,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198533408] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:02:45,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468111013] [2023-08-26 07:02:45,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:02:45,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:02:45,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:02:45,989 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:02:46,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 07:02:46,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:02:46,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-26 07:02:46,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:02:46,240 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-26 07:02:46,283 INFO L322 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2023-08-26 07:02:46,283 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 21 treesize of output 13 [2023-08-26 07:02:46,401 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 07:02:46,473 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-26 07:02:46,554 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-26 07:02:46,630 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-08-26 07:02:46,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,722 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2023-08-26 07:02:46,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,764 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2023-08-26 07:02:46,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,862 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 72 [2023-08-26 07:02:46,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:46,910 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 72 [2023-08-26 07:02:47,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:47,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:47,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:47,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:47,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:47,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:47,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:47,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:47,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:47,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:47,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:47,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:47,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:47,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:47,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:02:47,187 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:02:47,188 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 90 treesize of output 101 [2023-08-26 07:02:55,325 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 07:02:55,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:02:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:02:58,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468111013] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-26 07:02:58,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-26 07:02:58,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [21, 20] total 44 [2023-08-26 07:02:58,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693648305] [2023-08-26 07:02:58,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:02:58,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-26 07:02:58,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:02:58,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-26 07:02:58,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=1647, Unknown=3, NotChecked=0, Total=1980 [2023-08-26 07:02:58,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 177 [2023-08-26 07:02:58,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 317 transitions, 4509 flow. Second operand has 14 states, 14 states have (on average 60.42857142857143) internal successors, (846), 14 states have internal predecessors, (846), 0 states have call successors, (0), 0 states 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 07:02:58,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:02:58,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 177 [2023-08-26 07:02:58,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:03:10,714 INFO L124 PetriNetUnfolderBase]: 961/2121 cut-off events. [2023-08-26 07:03:10,715 INFO L125 PetriNetUnfolderBase]: For 18462/18462 co-relation queries the response was YES. [2023-08-26 07:03:10,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12871 conditions, 2121 events. 961/2121 cut-off events. For 18462/18462 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 13632 event pairs, 116 based on Foata normal form. 1/2122 useless extension candidates. Maximal degree in co-relation 12773. Up to 715 conditions per place. [2023-08-26 07:03:10,740 INFO L140 encePairwiseOnDemand]: 159/177 looper letters, 468 selfloop transitions, 110 changer transitions 41/619 dead transitions. [2023-08-26 07:03:10,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 619 transitions, 8478 flow [2023-08-26 07:03:10,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-26 07:03:10,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-26 07:03:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1333 transitions. [2023-08-26 07:03:10,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39637228664882546 [2023-08-26 07:03:10,744 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1333 transitions. [2023-08-26 07:03:10,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1333 transitions. [2023-08-26 07:03:10,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:03:10,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1333 transitions. [2023-08-26 07:03:10,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 70.15789473684211) internal successors, (1333), 19 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:03:10,751 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 177.0) internal successors, (3540), 20 states have internal predecessors, (3540), 0 states have call successors, (0), 0 states 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 07:03:10,752 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 177.0) internal successors, (3540), 20 states have internal predecessors, (3540), 0 states have call successors, (0), 0 states 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 07:03:10,752 INFO L175 Difference]: Start difference. First operand has 155 places, 317 transitions, 4509 flow. Second operand 19 states and 1333 transitions. [2023-08-26 07:03:10,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 619 transitions, 8478 flow [2023-08-26 07:03:10,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 619 transitions, 8136 flow, removed 11 selfloop flow, removed 7 redundant places. [2023-08-26 07:03:10,825 INFO L231 Difference]: Finished difference. Result has 179 places, 397 transitions, 5628 flow [2023-08-26 07:03:10,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=4298, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5628, PETRI_PLACES=179, PETRI_TRANSITIONS=397} [2023-08-26 07:03:10,826 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 140 predicate places. [2023-08-26 07:03:10,826 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 397 transitions, 5628 flow [2023-08-26 07:03:10,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 60.42857142857143) internal successors, (846), 14 states have internal predecessors, (846), 0 states have call successors, (0), 0 states 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 07:03:10,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:03:10,826 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:03:10,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 07:03:11,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:03:11,032 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-26 07:03:11,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:03:11,033 INFO L85 PathProgramCache]: Analyzing trace with hash 440868764, now seen corresponding path program 2 times [2023-08-26 07:03:11,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:03:11,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956270334] [2023-08-26 07:03:11,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:03:11,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:03:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:03:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:03:19,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:03:19,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956270334] [2023-08-26 07:03:19,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956270334] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:03:19,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023158723] [2023-08-26 07:03:19,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 07:03:19,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:03:19,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:03:19,750 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:03:19,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 07:03:19,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-26 07:03:19,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 07:03:19,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-26 07:03:19,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:03:19,864 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 07:03:19,916 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 07:03:19,964 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 21 treesize of output 20 [2023-08-26 07:03:20,016 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-26 07:03:20,072 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-08-26 07:03:20,140 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-26 07:03:20,140 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 22 treesize of output 15 [2023-08-26 07:03:20,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,209 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2023-08-26 07:03:20,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,243 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 59 [2023-08-26 07:03:20,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,326 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 74 [2023-08-26 07:03:20,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,360 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 74 [2023-08-26 07:03:20,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:03:20,572 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:03:20,572 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 98 treesize of output 115 [2023-08-26 07:03:50,493 WARN L234 SmtUtils]: Spent 14.08s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 07:03:50,494 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:03:50,494 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 07:03:50,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023158723] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:03:50,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 07:03:50,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [22] total 33 [2023-08-26 07:03:50,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039247828] [2023-08-26 07:03:50,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:03:50,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 07:03:50,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:03:50,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 07:03:50,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=975, Unknown=7, NotChecked=0, Total=1122 [2023-08-26 07:03:50,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 177 [2023-08-26 07:03:50,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 397 transitions, 5628 flow. Second operand has 12 states, 12 states have (on average 60.666666666666664) internal successors, (728), 12 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 07:03:50,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:03:50,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 177 [2023-08-26 07:03:50,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:03:54,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:03:56,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:03:58,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:04:00,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:04:05,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:04:09,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] [2023-08-26 07:04:11,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:04:13,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:04:17,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:04:19,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:04:21,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:04:37,681 WARN L234 SmtUtils]: Spent 14.08s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 07:04:39,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:04:41,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:04:43,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:04:46,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:04:48,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:04:50,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:04:50,328 INFO L124 PetriNetUnfolderBase]: 1160/2548 cut-off events. [2023-08-26 07:04:50,329 INFO L125 PetriNetUnfolderBase]: For 23296/23296 co-relation queries the response was YES. [2023-08-26 07:04:50,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16274 conditions, 2548 events. 1160/2548 cut-off events. For 23296/23296 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 17264 event pairs, 152 based on Foata normal form. 18/2566 useless extension candidates. Maximal degree in co-relation 16167. Up to 1381 conditions per place. [2023-08-26 07:04:50,363 INFO L140 encePairwiseOnDemand]: 159/177 looper letters, 433 selfloop transitions, 190 changer transitions 30/653 dead transitions. [2023-08-26 07:04:50,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 653 transitions, 9942 flow [2023-08-26 07:04:50,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 07:04:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 07:04:50,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 886 transitions. [2023-08-26 07:04:50,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4171374764595104 [2023-08-26 07:04:50,366 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 886 transitions. [2023-08-26 07:04:50,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 886 transitions. [2023-08-26 07:04:50,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:04:50,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 886 transitions. [2023-08-26 07:04:50,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 73.83333333333333) internal successors, (886), 12 states have internal predecessors, (886), 0 states have call successors, (0), 0 states 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 07:04:50,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 177.0) internal successors, (2301), 13 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states 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 07:04:50,370 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 177.0) internal successors, (2301), 13 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states 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 07:04:50,371 INFO L175 Difference]: Start difference. First operand has 179 places, 397 transitions, 5628 flow. Second operand 12 states and 886 transitions. [2023-08-26 07:04:50,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 653 transitions, 9942 flow [2023-08-26 07:04:50,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 653 transitions, 9874 flow, removed 34 selfloop flow, removed 0 redundant places. [2023-08-26 07:04:50,502 INFO L231 Difference]: Finished difference. Result has 197 places, 486 transitions, 7534 flow [2023-08-26 07:04:50,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=5590, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7534, PETRI_PLACES=197, PETRI_TRANSITIONS=486} [2023-08-26 07:04:50,503 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 158 predicate places. [2023-08-26 07:04:50,503 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 486 transitions, 7534 flow [2023-08-26 07:04:50,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 60.666666666666664) internal successors, (728), 12 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 07:04:50,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:04:50,504 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:04:50,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 07:04:50,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:04:50,704 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-26 07:04:50,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:04:50,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1764617884, now seen corresponding path program 3 times [2023-08-26 07:04:50,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:04:50,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388423981] [2023-08-26 07:04:50,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:04:50,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:04:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:05:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:05:23,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:05:23,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388423981] [2023-08-26 07:05:23,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388423981] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:05:23,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495901068] [2023-08-26 07:05:23,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 07:05:23,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:05:23,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:05:23,441 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:05:23,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 07:05:23,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-26 07:05:23,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 07:05:23,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-26 07:05:23,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:05:23,564 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 07:05:23,610 INFO L322 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2023-08-26 07:05:23,611 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 21 treesize of output 13 [2023-08-26 07:05:23,736 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 07:05:23,785 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-26 07:05:23,847 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-26 07:05:23,927 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-08-26 07:05:23,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:23,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:23,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:23,996 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:05:23,997 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2023-08-26 07:05:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:05:24,038 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 07:05:24,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495901068] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:05:24,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 07:05:24,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 26 [2023-08-26 07:05:24,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073976340] [2023-08-26 07:05:24,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:05:24,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 07:05:24,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:05:24,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 07:05:24,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2023-08-26 07:05:24,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 177 [2023-08-26 07:05:24,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 486 transitions, 7534 flow. Second operand has 10 states, 10 states have (on average 61.0) internal successors, (610), 10 states have internal predecessors, (610), 0 states have call successors, (0), 0 states 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 07:05:24,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:05:24,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 177 [2023-08-26 07:05:24,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:05:25,285 INFO L124 PetriNetUnfolderBase]: 1206/2638 cut-off events. [2023-08-26 07:05:25,285 INFO L125 PetriNetUnfolderBase]: For 30484/30484 co-relation queries the response was YES. [2023-08-26 07:05:25,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18337 conditions, 2638 events. 1206/2638 cut-off events. For 30484/30484 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17868 event pairs, 177 based on Foata normal form. 26/2664 useless extension candidates. Maximal degree in co-relation 18221. Up to 1090 conditions per place. [2023-08-26 07:05:25,322 INFO L140 encePairwiseOnDemand]: 161/177 looper letters, 528 selfloop transitions, 141 changer transitions 55/724 dead transitions. [2023-08-26 07:05:25,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 724 transitions, 11588 flow [2023-08-26 07:05:25,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 07:05:25,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 07:05:25,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 830 transitions. [2023-08-26 07:05:25,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4262968669748331 [2023-08-26 07:05:25,325 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 830 transitions. [2023-08-26 07:05:25,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 830 transitions. [2023-08-26 07:05:25,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:05:25,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 830 transitions. [2023-08-26 07:05:25,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 75.45454545454545) internal successors, (830), 11 states have internal predecessors, (830), 0 states have call successors, (0), 0 states 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 07:05:25,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 177.0) internal successors, (2124), 12 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:05:25,329 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 177.0) internal successors, (2124), 12 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:05:25,329 INFO L175 Difference]: Start difference. First operand has 197 places, 486 transitions, 7534 flow. Second operand 11 states and 830 transitions. [2023-08-26 07:05:25,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 724 transitions, 11588 flow [2023-08-26 07:05:25,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 724 transitions, 11462 flow, removed 32 selfloop flow, removed 2 redundant places. [2023-08-26 07:05:25,623 INFO L231 Difference]: Finished difference. Result has 211 places, 500 transitions, 8141 flow [2023-08-26 07:05:25,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=7448, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8141, PETRI_PLACES=211, PETRI_TRANSITIONS=500} [2023-08-26 07:05:25,624 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 172 predicate places. [2023-08-26 07:05:25,624 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 500 transitions, 8141 flow [2023-08-26 07:05:25,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 61.0) internal successors, (610), 10 states have internal predecessors, (610), 0 states have call successors, (0), 0 states 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 07:05:25,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:05:25,625 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:05:25,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 07:05:25,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-26 07:05:25,825 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-26 07:05:25,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:05:25,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1213389960, now seen corresponding path program 4 times [2023-08-26 07:05:25,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:05:25,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14999203] [2023-08-26 07:05:25,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:05:25,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:05:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:05:54,352 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:05:54,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:05:54,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14999203] [2023-08-26 07:05:54,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14999203] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:05:54,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038218837] [2023-08-26 07:05:54,352 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 07:05:54,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:05:54,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:05:54,353 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:05:54,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 07:05:54,465 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 07:05:54,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 07:05:54,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-26 07:05:54,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:05:54,561 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-08-26 07:05:54,631 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 07:05:54,675 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 21 treesize of output 20 [2023-08-26 07:05:54,731 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-26 07:05:54,790 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-26 07:05:54,791 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 22 treesize of output 15 [2023-08-26 07:05:54,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:54,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:54,861 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-08-26 07:05:54,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:54,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:54,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:54,898 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2023-08-26 07:05:54,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:54,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:54,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:54,920 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2023-08-26 07:05:54,956 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-08-26 07:05:55,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:55,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:55,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:55,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:55,031 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 59 [2023-08-26 07:05:55,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:55,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:55,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:55,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:55,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:55,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:55,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:55,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:55,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:55,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:55,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:55,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:55,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:55,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:55,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 07:05:55,274 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:05:55,274 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 122 treesize of output 126 [2023-08-26 07:06:21,456 WARN L234 SmtUtils]: Spent 14.06s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 07:06:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-26 07:06:21,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:07:17,338 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:07:17,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038218837] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-26 07:07:17,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-26 07:07:17,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [19, 16] total 46 [2023-08-26 07:07:17,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794539908] [2023-08-26 07:07:17,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:07:17,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-26 07:07:17,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:07:17,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-26 07:07:17,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1928, Unknown=13, NotChecked=0, Total=2162 [2023-08-26 07:07:17,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 177 [2023-08-26 07:07:17,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 500 transitions, 8141 flow. Second operand has 14 states, 14 states have (on average 60.42857142857143) internal successors, (846), 14 states have internal predecessors, (846), 0 states have call successors, (0), 0 states 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 07:07:17,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:07:17,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 177 [2023-08-26 07:07:17,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:07:20,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:07:21,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:07:24,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:07:27,397 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 07:07:30,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:07:32,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:07:37,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:07:39,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:07:42,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:07:44,772 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 07:07:46,790 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 07:07:48,880 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 07:07:52,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:07:54,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:07:55,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:07:58,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 07:08:00,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 07:08:02,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:08:05,084 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 07:08:08,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:08:10,111 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 07:08:12,123 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 07:08:14,216 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 07:08:16,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:08:20,816 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 07:08:23,034 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 07:08:25,047 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 07:08:27,187 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 07:08:29,203 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 07:08:31,218 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 07:08:34,264 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 07:08:36,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:08:38,900 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 07:08:40,981 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 07:08:42,996 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 07:08:45,050 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 07:08:47,177 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 07:08:49,185 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 07:08:58,296 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 07:09:01,329 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 07:09:03,520 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 07:09:05,539 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 07:09:07,553 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 07:09:09,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:09:11,692 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 07:09:13,707 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 07:09:15,853 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 07:09:17,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:09:20,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:09:22,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:09:24,355 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 07:09:26,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:09:28,589 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 07:09:38,770 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 07:09:41,470 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 07:09:43,535 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 07:09:54,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 07:09:56,566 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 07:09:58,576 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 07:10:01,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:10:03,117 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 07:10:05,213 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 07:10:07,230 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 07:10:09,244 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 07:10:11,373 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 07:10:13,392 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 07:10:15,406 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 07:10:17,509 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 07:10:19,523 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 07:10:21,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:10:23,599 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 07:10:26,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 [1] [2023-08-26 07:10:28,641 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 07:10:30,668 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 07:10:32,679 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 07:10:34,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 [1] [2023-08-26 07:10:36,939 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 07:10:45,323 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 07:10:47,353 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 07:10:49,411 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 07:10:51,425 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 07:10:53,434 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 07:10:55,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 07:10:57,503 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 07:10:59,949 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 07:11:01,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 07:11:05,293 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 07:11:07,406 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 07:11:09,425 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 07:11:11,438 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 07:11:13,637 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 07:11:15,655 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 07:11:17,669 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 07:11:19,805 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 07:11:21,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:11:23,837 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 07:11:25,985 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 07:11:28,006 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 07:11:31,556 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 07:11:34,218 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 07:11:36,499 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 07:11:38,507 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 07:11:40,516 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 07:11:42,529 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 07:11:44,538 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 07:11:46,548 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 07:11:48,596 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 07:11:50,628 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 07:11:52,637 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 07:11:54,679 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 07:11:57,366 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 07:11:59,377 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 07:12:02,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:12:04,445 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 07:12:06,460 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 07:12:08,473 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 07:12:10,565 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 07:12:12,585 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 07:12:14,600 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 07:12:16,711 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 07:12:18,744 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 07:12:20,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 07:12:22,941 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 07:12:25,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:12:27,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 07:12:30,133 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 07:12:32,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 [1] [2023-08-26 07:12:34,167 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 07:12:36,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:12:38,757 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 07:12:40,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 07:12:42,787 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 07:12:44,831 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 07:12:46,873 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 07:12:48,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:12:50,896 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 07:12:52,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:12:54,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:12:56,995 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) (.cse11 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#a~0.offset|)) (.cse18 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) (.cse8 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse9 (select |c_#race| |c_~#a~0.base|)) (.cse10 (select |c_#pthreadsMutex| |c_~#a~0.base|))) (and (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse3 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse4 (+ .cse3 |c_~#a~0.offset|)) (.cse1 (+ .cse3 |c_~#a~0.offset| 1)) (.cse6 (+ .cse3 2 |c_~#a~0.offset|))) (let ((.cse2 (let ((.cse7 (store |c_#race| |c_~#a~0.base| (store (store (store .cse9 .cse4 v_ArrVal_901) .cse1 v_ArrVal_902) .cse6 v_ArrVal_904)))) (store .cse7 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse7 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse0 (select .cse2 |c_~#a~0.base|))) (or (not (= (select .cse0 .cse1) 0)) (forall ((v_ArrVal_910 Int)) (= (select (select (store .cse2 |c_~#a~0.base| (store (store .cse0 (+ .cse3 3 |c_~#a~0.offset|) 0) .cse4 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse5) 0)) (not (= (select .cse0 .cse4) 0)) (not (= (select .cse0 .cse6) 0))))))) (not (= (select .cse10 (+ .cse3 |c_~#a~0.offset| 4)) 0))))) (forall ((v_ArrVal_910 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse9 .cse11 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8) 0)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse17 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse14 (+ .cse17 |c_~#a~0.offset|)) (.cse13 (+ .cse17 |c_~#a~0.offset| 1)) (.cse15 (+ .cse17 2 |c_~#a~0.offset|))) (let ((.cse16 (let ((.cse19 (store |c_#race| |c_~#a~0.base| (store (store (store .cse9 .cse14 v_ArrVal_901) .cse13 v_ArrVal_902) .cse15 v_ArrVal_904)))) (store .cse19 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse19 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse12 (select .cse16 |c_~#a~0.base|))) (or (not (= (select .cse12 .cse13) 0)) (not (= (select .cse12 .cse14) 0)) (not (= (select .cse12 .cse15) 0)) (forall ((v_ArrVal_910 Int)) (= (select (select (store .cse16 |c_~#a~0.base| (store (store .cse12 (+ .cse17 3 |c_~#a~0.offset|) 0) .cse14 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse18) 0))))))) (not (= (select .cse10 (+ .cse17 |c_~#a~0.offset| 4)) 0))))) (forall ((v_ArrVal_910 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse9 .cse11 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_910 Int)) (= 0 (select (select (store |c_#race| |c_~#a~0.base| (store .cse9 .cse11 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_910 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse9 .cse11 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse18) 0)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse20 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse10 (+ .cse20 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse23 (+ .cse20 |c_~#a~0.offset|)) (.cse22 (+ .cse20 |c_~#a~0.offset| 1)) (.cse24 (+ .cse20 2 |c_~#a~0.offset|))) (let ((.cse25 (let ((.cse26 (store |c_#race| |c_~#a~0.base| (store (store (store .cse9 .cse23 v_ArrVal_901) .cse22 v_ArrVal_902) .cse24 v_ArrVal_904)))) (store .cse26 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse26 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse21 (select .cse25 |c_~#a~0.base|))) (or (not (= (select .cse21 .cse22) 0)) (not (= (select .cse21 .cse23) 0)) (not (= (select .cse21 .cse24) 0)) (forall ((v_ArrVal_910 Int)) (= 0 (select (select (store .cse25 |c_~#a~0.base| (store (store .cse21 (+ .cse20 3 |c_~#a~0.offset|) 0) .cse23 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))))))))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse30 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse31 (+ .cse30 |c_~#a~0.offset|)) (.cse28 (+ .cse30 |c_~#a~0.offset| 1)) (.cse32 (+ .cse30 2 |c_~#a~0.offset|))) (let ((.cse29 (let ((.cse33 (store |c_#race| |c_~#a~0.base| (store (store (store .cse9 .cse31 v_ArrVal_901) .cse28 v_ArrVal_902) .cse32 v_ArrVal_904)))) (store .cse33 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse33 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse27 (select .cse29 |c_~#a~0.base|))) (or (not (= (select .cse27 .cse28) 0)) (forall ((v_ArrVal_910 Int)) (= (select (select (store .cse29 |c_~#a~0.base| (store (store .cse27 (+ .cse30 3 |c_~#a~0.offset|) 0) .cse31 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8) 0)) (not (= (select .cse27 .cse31) 0)) (not (= (select .cse27 .cse32) 0))))))) (not (= (select .cse10 (+ .cse30 |c_~#a~0.offset| 4)) 0))))))) is different from true [2023-08-26 07:12:59,013 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 07:13:02,440 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 07:13:04,448 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 07:13:07,581 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 07:13:09,735 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 07:13:11,751 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 07:13:13,885 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 07:13:15,903 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 07:13:17,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:13:19,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:13:21,457 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 07:13:37,693 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 07:13:39,845 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 07:13:42,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:13:44,080 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 07:13:47,545 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 07:13:49,566 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 07:13:51,633 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 07:13:53,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:13:55,813 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 07:13:57,864 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 07:14:00,636 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 07:14:02,645 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 07:14:03,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:14:06,398 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 07:14:08,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 07:14:10,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:14:12,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:14:14,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:14:16,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:14:18,747 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 07:14:20,763 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 07:14:22,865 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 07:14:24,885 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 07:14:26,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:14:28,989 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 07:14:31,004 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 07:14:33,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 07:14:35,151 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 07:14:37,164 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 07:14:39,230 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 07:14:40,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:14:43,657 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 07:14:45,674 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 07:14:47,695 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 07:14:49,710 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 07:14:51,758 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 07:14:53,792 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 07:14:55,802 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 07:15:05,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:15:07,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:15:08,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:15:10,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:15:12,310 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 07:15:14,383 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 07:15:16,392 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 07:15:19,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:15:21,780 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 07:15:23,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:15:25,816 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 07:15:27,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:15:29,980 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 07:15:32,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:15:34,114 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 07:15:36,129 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 07:15:37,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:15:40,007 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 07:15:42,099 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 07:15:44,115 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 07:15:48,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:15:50,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:15:51,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:15:53,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:15:55,536 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 07:15:57,546 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 07:15:59,560 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 07:16:01,576 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 07:16:03,583 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 07:16:05,592 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 07:16:07,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:16:09,092 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 07:16:11,118 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse16 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2))) (let ((.cse9 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse16 0)))) (let ((.cse35 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#a~0.offset|)) (.cse32 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) (.cse19 (select |c_#race| |c_~#a~0.base|)) (.cse6 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse10 (select .cse9 |c_~#a~0.base|)) (.cse0 (select |c_#pthreadsMutex| |c_~#a~0.base|))) (and (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse1 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse1 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse4 (+ .cse1 |c_~#a~0.offset|)) (.cse7 (+ .cse1 |c_~#a~0.offset| 1)) (.cse3 (+ .cse1 2 |c_~#a~0.offset|))) (let ((.cse5 (let ((.cse8 (store .cse9 |c_~#a~0.base| (store (store (store .cse10 .cse4 v_ArrVal_901) .cse7 v_ArrVal_902) .cse3 v_ArrVal_904)))) (store .cse8 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse8 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (let ((.cse2 (select .cse5 |c_~#a~0.base|))) (or (not (= (select .cse2 .cse3) 0)) (not (= (select .cse2 .cse4) 0)) (forall ((v_ArrVal_910 Int)) (= (select (select (store .cse5 |c_~#a~0.base| (store (store .cse2 (+ .cse1 3 |c_~#a~0.offset|) 0) .cse4 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6) 0)) (not (= (select .cse2 .cse7) 0)))))))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse14 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse15 (+ .cse14 |c_~#a~0.offset|)) (.cse12 (+ .cse14 |c_~#a~0.offset| 1)) (.cse17 (+ .cse14 2 |c_~#a~0.offset|))) (let ((.cse13 (let ((.cse18 (store |c_#race| |c_~#a~0.base| (store (store (store .cse19 .cse15 v_ArrVal_901) .cse12 v_ArrVal_902) .cse17 v_ArrVal_904)))) (store .cse18 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse18 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (let ((.cse11 (select .cse13 |c_~#a~0.base|))) (or (not (= (select .cse11 .cse12) 0)) (forall ((v_ArrVal_910 Int)) (= (select (select (store .cse13 |c_~#a~0.base| (store (store .cse11 (+ .cse14 3 |c_~#a~0.offset|) 0) .cse15 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse16) 0)) (not (= (select .cse11 .cse15) 0)) (not (= (select .cse11 .cse17) 0))))))) (not (= (select .cse0 (+ .cse14 |c_~#a~0.offset| 4)) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse24 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse22 (+ .cse24 |c_~#a~0.offset|)) (.cse25 (+ .cse24 |c_~#a~0.offset| 1)) (.cse21 (+ .cse24 2 |c_~#a~0.offset|))) (let ((.cse23 (let ((.cse26 (store .cse9 |c_~#a~0.base| (store (store (store .cse10 .cse22 v_ArrVal_901) .cse25 v_ArrVal_902) .cse21 v_ArrVal_904)))) (store .cse26 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse26 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (let ((.cse20 (select .cse23 |c_~#a~0.base|))) (or (not (= (select .cse20 .cse21) 0)) (not (= (select .cse20 .cse22) 0)) (forall ((v_ArrVal_910 Int)) (= (select (select (store .cse23 |c_~#a~0.base| (store (store .cse20 (+ .cse24 3 |c_~#a~0.offset|) 0) .cse22 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse16) 0)) (not (= (select .cse20 .cse25) 0))))))) (not (= (select .cse0 (+ .cse24 |c_~#a~0.offset| 4)) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse27 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse27 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse31 (+ .cse27 |c_~#a~0.offset|)) (.cse33 (+ .cse27 |c_~#a~0.offset| 1)) (.cse29 (+ .cse27 2 |c_~#a~0.offset|))) (let ((.cse30 (let ((.cse34 (store .cse9 |c_~#a~0.base| (store (store (store .cse10 .cse31 v_ArrVal_901) .cse33 v_ArrVal_902) .cse29 v_ArrVal_904)))) (store .cse34 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse34 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (let ((.cse28 (select .cse30 |c_~#a~0.base|))) (or (not (= (select .cse28 .cse29) 0)) (forall ((v_ArrVal_910 Int)) (= (select (select (store .cse30 |c_~#a~0.base| (store (store .cse28 (+ .cse27 3 |c_~#a~0.offset|) 0) .cse31 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse32) 0)) (not (= (select .cse28 .cse31) 0)) (not (= (select .cse28 .cse33) 0)))))))))) (forall ((v_ArrVal_910 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse19 .cse35 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6) 0)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse41 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse38 (+ .cse41 |c_~#a~0.offset|)) (.cse37 (+ .cse41 |c_~#a~0.offset| 1)) (.cse39 (+ .cse41 2 |c_~#a~0.offset|))) (let ((.cse40 (let ((.cse42 (store |c_#race| |c_~#a~0.base| (store (store (store .cse19 .cse38 v_ArrVal_901) .cse37 v_ArrVal_902) .cse39 v_ArrVal_904)))) (store .cse42 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse42 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (let ((.cse36 (select .cse40 |c_~#a~0.base|))) (or (not (= (select .cse36 .cse37) 0)) (not (= (select .cse36 .cse38) 0)) (not (= (select .cse36 .cse39) 0)) (forall ((v_ArrVal_910 Int)) (= (select (select (store .cse40 |c_~#a~0.base| (store (store .cse36 (+ .cse41 3 |c_~#a~0.offset|) 0) .cse38 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse32) 0))))))) (not (= (select .cse0 (+ .cse41 |c_~#a~0.offset| 4)) 0))))) (forall ((v_ArrVal_910 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse19 .cse35 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse16) 0)) (forall ((v_ArrVal_910 Int)) (= 0 (select (select (store |c_#race| |c_~#a~0.base| (store .cse19 .cse35 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_910 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse19 .cse35 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse32) 0)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse43 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse0 (+ .cse43 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse46 (+ .cse43 |c_~#a~0.offset|)) (.cse45 (+ .cse43 |c_~#a~0.offset| 1)) (.cse47 (+ .cse43 2 |c_~#a~0.offset|))) (let ((.cse48 (let ((.cse49 (store |c_#race| |c_~#a~0.base| (store (store (store .cse19 .cse46 v_ArrVal_901) .cse45 v_ArrVal_902) .cse47 v_ArrVal_904)))) (store .cse49 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse49 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (let ((.cse44 (select .cse48 |c_~#a~0.base|))) (or (not (= (select .cse44 .cse45) 0)) (not (= (select .cse44 .cse46) 0)) (not (= (select .cse44 .cse47) 0)) (forall ((v_ArrVal_910 Int)) (= 0 (select (select (store .cse48 |c_~#a~0.base| (store (store .cse44 (+ .cse43 3 |c_~#a~0.offset|) 0) .cse46 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))))))))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse53 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse54 (+ .cse53 |c_~#a~0.offset|)) (.cse51 (+ .cse53 |c_~#a~0.offset| 1)) (.cse55 (+ .cse53 2 |c_~#a~0.offset|))) (let ((.cse52 (let ((.cse56 (store |c_#race| |c_~#a~0.base| (store (store (store .cse19 .cse54 v_ArrVal_901) .cse51 v_ArrVal_902) .cse55 v_ArrVal_904)))) (store .cse56 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse56 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (let ((.cse50 (select .cse52 |c_~#a~0.base|))) (or (not (= (select .cse50 .cse51) 0)) (forall ((v_ArrVal_910 Int)) (= (select (select (store .cse52 |c_~#a~0.base| (store (store .cse50 (+ .cse53 3 |c_~#a~0.offset|) 0) .cse54 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6) 0)) (not (= (select .cse50 .cse54) 0)) (not (= (select .cse50 .cse55) 0))))))) (not (= (select .cse0 (+ .cse53 |c_~#a~0.offset| 4)) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse61 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse59 (+ .cse61 |c_~#a~0.offset|)) (.cse62 (+ .cse61 |c_~#a~0.offset| 1)) (.cse58 (+ .cse61 2 |c_~#a~0.offset|))) (let ((.cse60 (let ((.cse63 (store .cse9 |c_~#a~0.base| (store (store (store .cse10 .cse59 v_ArrVal_901) .cse62 v_ArrVal_902) .cse58 v_ArrVal_904)))) (store .cse63 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse63 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse6 0))))) (let ((.cse57 (select .cse60 |c_~#a~0.base|))) (or (not (= (select .cse57 .cse58) 0)) (not (= (select .cse57 .cse59) 0)) (forall ((v_ArrVal_910 Int)) (= 0 (select (select (store .cse60 |c_~#a~0.base| (store (store .cse57 (+ .cse61 3 |c_~#a~0.offset|) 0) .cse59 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (not (= (select .cse57 .cse62) 0))))))) (not (= (select .cse0 (+ .cse61 |c_~#a~0.offset| 4)) 0))))))))) is different from true [2023-08-26 07:16:15,575 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 07:16:17,712 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 07:16:19,721 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 07:16:21,734 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 07:16:23,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-08-26 07:16:25,754 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 07:16:25,754 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 07:16:25,795 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 07:16:25,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-26 07:16:25,808 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2023-08-26 07:16:25,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 07:16:26,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-26 07:16:26,009 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (14states, 59/177 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 4522 conditions, 563 events (235/562 cut-off events. For 11797/11797 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3512 event pairs, 40 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 4438. Up to 312 conditions per place.). [2023-08-26 07:16:26,010 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-08-26 07:16:26,010 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-08-26 07:16:26,010 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-26 07:16:26,010 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-08-26 07:16:26,010 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-08-26 07:16:26,011 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-08-26 07:16:26,011 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 1, 1, 1] [2023-08-26 07:16:26,015 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 07:16:26,015 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 07:16:26,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 07:16:26 BasicIcfg [2023-08-26 07:16:26,017 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 07:16:26,017 INFO L158 Benchmark]: Toolchain (without parser) took 840368.28ms. Allocated memory was 354.4MB in the beginning and 13.7GB in the end (delta: 13.3GB). Free memory was 329.1MB in the beginning and 6.9GB in the end (delta: -6.6GB). Peak memory consumption was 6.7GB. Max. memory is 16.0GB. [2023-08-26 07:16:26,017 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 354.4MB. Free memory is still 330.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 07:16:26,017 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.42ms. Allocated memory is still 354.4MB. Free memory was 329.1MB in the beginning and 300.9MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-26 07:16:26,017 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.60ms. Allocated memory is still 354.4MB. Free memory was 300.9MB in the beginning and 298.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 07:16:26,017 INFO L158 Benchmark]: Boogie Preprocessor took 27.98ms. Allocated memory is still 354.4MB. Free memory was 298.1MB in the beginning and 296.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 07:16:26,018 INFO L158 Benchmark]: RCFGBuilder took 369.58ms. Allocated memory is still 354.4MB. Free memory was 296.3MB in the beginning and 329.9MB in the end (delta: -33.6MB). Peak memory consumption was 20.5MB. Max. memory is 16.0GB. [2023-08-26 07:16:26,018 INFO L158 Benchmark]: TraceAbstraction took 839360.69ms. Allocated memory was 354.4MB in the beginning and 13.7GB in the end (delta: 13.3GB). Free memory was 329.0MB in the beginning and 6.9GB in the end (delta: -6.6GB). Peak memory consumption was 6.7GB. Max. memory is 16.0GB. [2023-08-26 07:16:26,018 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.19ms. Allocated memory is still 354.4MB. Free memory is still 330.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 559.42ms. Allocated memory is still 354.4MB. Free memory was 329.1MB in the beginning and 300.9MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 44.60ms. Allocated memory is still 354.4MB. Free memory was 300.9MB in the beginning and 298.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 27.98ms. Allocated memory is still 354.4MB. Free memory was 298.1MB in the beginning and 296.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 369.58ms. Allocated memory is still 354.4MB. Free memory was 296.3MB in the beginning and 329.9MB in the end (delta: -33.6MB). Peak memory consumption was 20.5MB. Max. memory is 16.0GB. * TraceAbstraction took 839360.69ms. Allocated memory was 354.4MB in the beginning and 13.7GB in the end (delta: 13.3GB). Free memory was 329.0MB in the beginning and 6.9GB in the end (delta: -6.6GB). Peak memory consumption was 6.7GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 249]: Unsoundness Warning unspecified type, defaulting to int C: short [249] - GenericResultAtLocation [Line: 249]: Unsoundness Warning unspecified type, defaulting to int C: short [249] - GenericResultAtLocation [Line: 741]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [741] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 101 PlacesBefore, 39 PlacesAfterwards, 101 TransitionsBefore, 36 TransitionsAfterwards, 2262 CoEnabledTransitionPairs, 6 FixpointIterations, 28 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 3 ConcurrentYvCompositions, 3 ChoiceCompositions, 75 TotalNumberOfCompositions, 8906 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2718, independent: 2322, independent conditional: 0, independent unconditional: 2322, dependent: 396, dependent conditional: 0, dependent unconditional: 396, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1084, independent: 1033, independent conditional: 0, independent unconditional: 1033, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2718, independent: 1289, independent conditional: 0, independent unconditional: 1289, dependent: 345, dependent conditional: 0, dependent unconditional: 345, unknown: 1084, unknown conditional: 0, unknown unconditional: 1084] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 932]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (14states, 59/177 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 4522 conditions, 563 events (235/562 cut-off events. For 11797/11797 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3512 event pairs, 40 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 4438. Up to 312 conditions per place.). - TimeoutResultAtElement [Line: 944]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (14states, 59/177 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 4522 conditions, 563 events (235/562 cut-off events. For 11797/11797 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3512 event pairs, 40 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 4438. Up to 312 conditions per place.). - TimeoutResultAtElement [Line: 944]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (14states, 59/177 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 4522 conditions, 563 events (235/562 cut-off events. For 11797/11797 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3512 event pairs, 40 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 4438. Up to 312 conditions per place.). - TimeoutResultAtElement [Line: 942]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (14states, 59/177 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 4522 conditions, 563 events (235/562 cut-off events. For 11797/11797 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3512 event pairs, 40 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 4438. Up to 312 conditions per place.). - TimeoutResultAtElement [Line: 932]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (14states, 59/177 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 4522 conditions, 563 events (235/562 cut-off events. For 11797/11797 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3512 event pairs, 40 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 4438. Up to 312 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 139 locations, 7 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: 839.2s, OverallIterations: 15, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 628.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.1s, HoareTripleCheckerStatistics: 210 mSolverCounterUnknown, 876 SdHoareTripleChecker+Valid, 539.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 876 mSDsluCounter, 176 SdHoareTripleChecker+Invalid, 536.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 62 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 410 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5934 IncrementalHoareTripleChecker+Invalid, 6616 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 410 mSolverCounterUnsat, 144 mSDtfsCounter, 5934 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 445 GetRequests, 193 SyntacticMatches, 6 SemanticMatches, 246 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 207.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8141occurred in iteration=14, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 206.0s InterpolantComputationTime, 500 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 564 ConstructedInterpolants, 25 QuantifiedInterpolants, 29308 SizeOfPredicates, 21 NumberOfNonLiveVariables, 963 ConjunctsInSsa, 213 ConjunctsInUnsatCore, 25 InterpolantComputations, 13 PerfectInterpolantSequences, 588/933 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