/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/28-race_reach_73-funloop_hard_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 07:52:09,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 07:52:09,333 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:52:09,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 07:52:09,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 07:52:09,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 07:52:09,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 07:52:09,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 07:52:09,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 07:52:09,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 07:52:09,380 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 07:52:09,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 07:52:09,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 07:52:09,381 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 07:52:09,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 07:52:09,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 07:52:09,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 07:52:09,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 07:52:09,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 07:52:09,383 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 07:52:09,383 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 07:52:09,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 07:52:09,387 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 07:52:09,387 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 07:52:09,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 07:52:09,390 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 07:52:09,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 07:52:09,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 07:52:09,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 07:52:09,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 07:52:09,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 07:52:09,392 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 07:52:09,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 07:52:09,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 07:52:09,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 07:52:09,392 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:52:09,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 07:52:09,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 07:52:09,710 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 07:52:09,711 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 07:52:09,711 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 07:52:09,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2023-08-26 07:52:10,858 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 07:52:11,130 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 07:52:11,131 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_73-funloop_hard_racefree.i [2023-08-26 07:52:11,145 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b36c9ff/c011b6cde5be462d9b2ff5975dbc36d8/FLAGbcc8a2323 [2023-08-26 07:52:11,157 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0b36c9ff/c011b6cde5be462d9b2ff5975dbc36d8 [2023-08-26 07:52:11,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 07:52:11,160 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 07:52:11,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 07:52:11,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 07:52:11,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 07:52:11,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:52:11" (1/1) ... [2023-08-26 07:52:11,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56da99d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:11, skipping insertion in model container [2023-08-26 07:52:11,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:52:11" (1/1) ... [2023-08-26 07:52:11,229 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 07:52:11,673 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 07:52:11,696 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 07:52:11,724 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 07:52:11,726 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 07:52:11,731 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-26 07:52:11,767 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 07:52:11,834 INFO L206 MainTranslator]: Completed translation [2023-08-26 07:52:11,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:11 WrapperNode [2023-08-26 07:52:11,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 07:52:11,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 07:52:11,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 07:52:11,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 07:52:11,843 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:52:11" (1/1) ... [2023-08-26 07:52:11,879 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:52:11" (1/1) ... [2023-08-26 07:52:11,931 INFO L138 Inliner]: procedures = 271, calls = 42, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 354 [2023-08-26 07:52:11,932 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 07:52:11,933 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 07:52:11,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 07:52:11,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 07:52:11,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:11" (1/1) ... [2023-08-26 07:52:11,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:11" (1/1) ... [2023-08-26 07:52:11,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:11" (1/1) ... [2023-08-26 07:52:11,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:11" (1/1) ... [2023-08-26 07:52:11,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:11" (1/1) ... [2023-08-26 07:52:11,995 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:11" (1/1) ... [2023-08-26 07:52:12,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:11" (1/1) ... [2023-08-26 07:52:12,005 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:11" (1/1) ... [2023-08-26 07:52:12,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 07:52:12,010 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 07:52:12,010 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 07:52:12,010 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 07:52:12,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:11" (1/1) ... [2023-08-26 07:52:12,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 07:52:12,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:52:12,042 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:52:12,047 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:52:12,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 07:52:12,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 07:52:12,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 07:52:12,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 07:52:12,074 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 07:52:12,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 07:52:12,074 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-26 07:52:12,074 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-26 07:52:12,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 07:52:12,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 07:52:12,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 07:52:12,076 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:52:12,192 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 07:52:12,194 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 07:52:12,711 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 07:52:12,721 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 07:52:12,722 INFO L302 CfgBuilder]: Removed 35 assume(true) statements. [2023-08-26 07:52:12,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:52:12 BoogieIcfgContainer [2023-08-26 07:52:12,725 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 07:52:12,727 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 07:52:12,727 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 07:52:12,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 07:52:12,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 07:52:11" (1/3) ... [2023-08-26 07:52:12,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b74c36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:52:12, skipping insertion in model container [2023-08-26 07:52:12,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:52:11" (2/3) ... [2023-08-26 07:52:12,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b74c36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:52:12, skipping insertion in model container [2023-08-26 07:52:12,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:52:12" (3/3) ... [2023-08-26 07:52:12,733 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_73-funloop_hard_racefree.i [2023-08-26 07:52:12,749 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 07:52:12,749 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2023-08-26 07:52:12,749 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 07:52:12,838 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-26 07:52:12,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 324 places, 369 transitions, 746 flow [2023-08-26 07:52:13,082 INFO L124 PetriNetUnfolderBase]: 78/588 cut-off events. [2023-08-26 07:52:13,082 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 07:52:13,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 588 events. 78/588 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3217 event pairs, 0 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 331. Up to 8 conditions per place. [2023-08-26 07:52:13,096 INFO L82 GeneralOperation]: Start removeDead. Operand has 324 places, 369 transitions, 746 flow [2023-08-26 07:52:13,107 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 324 places, 369 transitions, 746 flow [2023-08-26 07:52:13,111 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 07:52:13,126 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 324 places, 369 transitions, 746 flow [2023-08-26 07:52:13,129 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 324 places, 369 transitions, 746 flow [2023-08-26 07:52:13,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 324 places, 369 transitions, 746 flow [2023-08-26 07:52:13,224 INFO L124 PetriNetUnfolderBase]: 78/588 cut-off events. [2023-08-26 07:52:13,224 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 07:52:13,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 594 conditions, 588 events. 78/588 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3217 event pairs, 0 based on Foata normal form. 0/475 useless extension candidates. Maximal degree in co-relation 331. Up to 8 conditions per place. [2023-08-26 07:52:13,255 INFO L119 LiptonReduction]: Number of co-enabled transitions 48150 [2023-08-26 07:52:16,762 INFO L134 LiptonReduction]: Checked pairs total: 190200 [2023-08-26 07:52:16,762 INFO L136 LiptonReduction]: Total number of compositions: 226 [2023-08-26 07:52:16,775 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 07:52:16,780 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;@368a3257, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 07:52:16,781 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-08-26 07:52:16,792 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 07:52:16,792 INFO L124 PetriNetUnfolderBase]: 31/132 cut-off events. [2023-08-26 07:52:16,792 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 07:52:16,793 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:52:16,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:52:16,794 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-26 07:52:16,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:52:16,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1153286535, now seen corresponding path program 1 times [2023-08-26 07:52:16,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:52:16,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680327173] [2023-08-26 07:52:16,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:52:16,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:52:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:52:17,092 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:52:17,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:52:17,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680327173] [2023-08-26 07:52:17,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680327173] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:52:17,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:52:17,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 07:52:17,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137095602] [2023-08-26 07:52:17,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:52:17,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 07:52:17,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:52:17,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 07:52:17,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 07:52:17,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 595 [2023-08-26 07:52:17,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 197 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 317.0) internal successors, (951), 3 states have internal predecessors, (951), 0 states have call successors, (0), 0 states 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:52:17,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:52:17,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 595 [2023-08-26 07:52:17,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:52:17,598 INFO L124 PetriNetUnfolderBase]: 905/3224 cut-off events. [2023-08-26 07:52:17,598 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 07:52:17,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4919 conditions, 3224 events. 905/3224 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 27276 event pairs, 760 based on Foata normal form. 399/3243 useless extension candidates. Maximal degree in co-relation 4749. Up to 1687 conditions per place. [2023-08-26 07:52:17,616 INFO L140 encePairwiseOnDemand]: 559/595 looper letters, 66 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2023-08-26 07:52:17,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 165 transitions, 474 flow [2023-08-26 07:52:17,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 07:52:17,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 07:52:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1047 transitions. [2023-08-26 07:52:17,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5865546218487395 [2023-08-26 07:52:17,632 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1047 transitions. [2023-08-26 07:52:17,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1047 transitions. [2023-08-26 07:52:17,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:52:17,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1047 transitions. [2023-08-26 07:52:17,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 349.0) internal successors, (1047), 3 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states 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:52:17,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 595.0) internal successors, (2380), 4 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states 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:52:17,649 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 595.0) internal successors, (2380), 4 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states 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:52:17,651 INFO L175 Difference]: Start difference. First operand has 160 places, 197 transitions, 402 flow. Second operand 3 states and 1047 transitions. [2023-08-26 07:52:17,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 165 transitions, 474 flow [2023-08-26 07:52:17,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 165 transitions, 474 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 07:52:17,659 INFO L231 Difference]: Finished difference. Result has 163 places, 165 transitions, 348 flow [2023-08-26 07:52:17,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=595, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=163, PETRI_TRANSITIONS=165} [2023-08-26 07:52:17,663 INFO L281 CegarLoopForPetriNet]: 160 programPoint places, 3 predicate places. [2023-08-26 07:52:17,664 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 165 transitions, 348 flow [2023-08-26 07:52:17,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.0) internal successors, (951), 3 states have internal predecessors, (951), 0 states have call successors, (0), 0 states 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:52:17,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:52:17,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:52:17,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 07:52:17,665 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-26 07:52:17,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:52:17,666 INFO L85 PathProgramCache]: Analyzing trace with hash 885329130, now seen corresponding path program 1 times [2023-08-26 07:52:17,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:52:17,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898583475] [2023-08-26 07:52:17,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:52:17,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:52:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:52:17,773 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:52:17,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:52:17,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898583475] [2023-08-26 07:52:17,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898583475] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:52:17,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855428765] [2023-08-26 07:52:17,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:52:17,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:52:17,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:52:17,777 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:52:17,807 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:52:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:52:17,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-26 07:52:17,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:52:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 07:52:17,893 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 07:52:17,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855428765] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:52:17,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 07:52:17,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-26 07:52:17,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155126565] [2023-08-26 07:52:17,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:52:17,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 07:52:17,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:52:17,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 07:52:17,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 07:52:17,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 595 [2023-08-26 07:52:17,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 165 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states 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:52:17,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:52:17,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 595 [2023-08-26 07:52:17,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:52:18,260 INFO L124 PetriNetUnfolderBase]: 901/3131 cut-off events. [2023-08-26 07:52:18,261 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 07:52:18,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4802 conditions, 3131 events. 901/3131 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 26195 event pairs, 546 based on Foata normal form. 0/2758 useless extension candidates. Maximal degree in co-relation 4790. Up to 1628 conditions per place. [2023-08-26 07:52:18,303 INFO L140 encePairwiseOnDemand]: 592/595 looper letters, 87 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2023-08-26 07:52:18,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 186 transitions, 568 flow [2023-08-26 07:52:18,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 07:52:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 07:52:18,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1034 transitions. [2023-08-26 07:52:18,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5792717086834734 [2023-08-26 07:52:18,307 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1034 transitions. [2023-08-26 07:52:18,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1034 transitions. [2023-08-26 07:52:18,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:52:18,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1034 transitions. [2023-08-26 07:52:18,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 344.6666666666667) internal successors, (1034), 3 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states 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:52:18,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 595.0) internal successors, (2380), 4 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states 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:52:18,315 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 595.0) internal successors, (2380), 4 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states 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:52:18,315 INFO L175 Difference]: Start difference. First operand has 163 places, 165 transitions, 348 flow. Second operand 3 states and 1034 transitions. [2023-08-26 07:52:18,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 186 transitions, 568 flow [2023-08-26 07:52:18,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 186 transitions, 564 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 07:52:18,320 INFO L231 Difference]: Finished difference. Result has 165 places, 165 transitions, 352 flow [2023-08-26 07:52:18,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=595, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=165, PETRI_TRANSITIONS=165} [2023-08-26 07:52:18,321 INFO L281 CegarLoopForPetriNet]: 160 programPoint places, 5 predicate places. [2023-08-26 07:52:18,321 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 165 transitions, 352 flow [2023-08-26 07:52:18,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states 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:52:18,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:52:18,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:52:18,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 07:52:18,528 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:52:18,528 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-26 07:52:18,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:52:18,529 INFO L85 PathProgramCache]: Analyzing trace with hash 438976160, now seen corresponding path program 1 times [2023-08-26 07:52:18,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:52:18,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890971724] [2023-08-26 07:52:18,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:52:18,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:52:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:52:18,622 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:52:18,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:52:18,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890971724] [2023-08-26 07:52:18,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890971724] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:52:18,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727759792] [2023-08-26 07:52:18,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:52:18,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:52:18,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:52:18,625 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:52:18,627 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:52:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:52:18,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 07:52:18,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:52:18,777 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:52:18,777 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:52:18,799 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:52:18,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727759792] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:52:18,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:52:18,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 07:52:18,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531563350] [2023-08-26 07:52:18,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:52:18,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 07:52:18,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:52:18,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 07:52:18,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 07:52:18,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 595 [2023-08-26 07:52:18,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 165 transitions, 352 flow. Second operand has 7 states, 7 states have (on average 317.0) internal successors, (2219), 7 states have internal predecessors, (2219), 0 states have call successors, (0), 0 states 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:52:18,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:52:18,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 595 [2023-08-26 07:52:18,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:52:19,175 INFO L124 PetriNetUnfolderBase]: 901/3135 cut-off events. [2023-08-26 07:52:19,175 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2023-08-26 07:52:19,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4866 conditions, 3135 events. 901/3135 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 26206 event pairs, 760 based on Foata normal form. 3/2768 useless extension candidates. Maximal degree in co-relation 4839. Up to 1650 conditions per place. [2023-08-26 07:52:19,195 INFO L140 encePairwiseOnDemand]: 592/595 looper letters, 66 selfloop transitions, 5 changer transitions 0/168 dead transitions. [2023-08-26 07:52:19,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 168 transitions, 506 flow [2023-08-26 07:52:19,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:52:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:52:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1964 transitions. [2023-08-26 07:52:19,200 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.550140056022409 [2023-08-26 07:52:19,200 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1964 transitions. [2023-08-26 07:52:19,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1964 transitions. [2023-08-26 07:52:19,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:52:19,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1964 transitions. [2023-08-26 07:52:19,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 327.3333333333333) internal successors, (1964), 6 states have internal predecessors, (1964), 0 states have call successors, (0), 0 states 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:52:19,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 595.0) internal successors, (4165), 7 states have internal predecessors, (4165), 0 states have call successors, (0), 0 states 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:52:19,214 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 595.0) internal successors, (4165), 7 states have internal predecessors, (4165), 0 states have call successors, (0), 0 states 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:52:19,215 INFO L175 Difference]: Start difference. First operand has 165 places, 165 transitions, 352 flow. Second operand 6 states and 1964 transitions. [2023-08-26 07:52:19,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 168 transitions, 506 flow [2023-08-26 07:52:19,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 168 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 07:52:19,221 INFO L231 Difference]: Finished difference. Result has 171 places, 168 transitions, 384 flow [2023-08-26 07:52:19,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=595, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=171, PETRI_TRANSITIONS=168} [2023-08-26 07:52:19,222 INFO L281 CegarLoopForPetriNet]: 160 programPoint places, 11 predicate places. [2023-08-26 07:52:19,223 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 168 transitions, 384 flow [2023-08-26 07:52:19,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 317.0) internal successors, (2219), 7 states have internal predecessors, (2219), 0 states have call successors, (0), 0 states 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:52:19,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:52:19,225 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:52:19,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 07:52:19,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-26 07:52:19,431 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-26 07:52:19,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:52:19,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1733868750, now seen corresponding path program 2 times [2023-08-26 07:52:19,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:52:19,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399954537] [2023-08-26 07:52:19,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:52:19,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:52:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:52:19,513 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:52:19,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:52:19,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399954537] [2023-08-26 07:52:19,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399954537] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:52:19,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924049871] [2023-08-26 07:52:19,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 07:52:19,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:52:19,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:52:19,515 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:52:19,523 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:52:19,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-26 07:52:19,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 07:52:19,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 07:52:19,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:52:19,626 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:52:19,640 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-26 07:52:19,664 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:52:19,664 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 30 treesize of output 32 [2023-08-26 07:52:19,694 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:52:19,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-08-26 07:52:19,717 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:52:19,717 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 07:52:19,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924049871] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:52:19,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 07:52:19,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2023-08-26 07:52:19,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291448670] [2023-08-26 07:52:19,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:52:19,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:52:19,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:52:19,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:52:19,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-08-26 07:52:19,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 595 [2023-08-26 07:52:19,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 168 transitions, 384 flow. Second operand has 6 states, 6 states have (on average 220.33333333333334) internal successors, (1322), 6 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states 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:52:19,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:52:19,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 595 [2023-08-26 07:52:19,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:52:21,696 INFO L124 PetriNetUnfolderBase]: 6425/13101 cut-off events. [2023-08-26 07:52:21,697 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-08-26 07:52:21,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25834 conditions, 13101 events. 6425/13101 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 97132 event pairs, 2340 based on Foata normal form. 0/11022 useless extension candidates. Maximal degree in co-relation 25799. Up to 8497 conditions per place. [2023-08-26 07:52:21,793 INFO L140 encePairwiseOnDemand]: 557/595 looper letters, 480 selfloop transitions, 83 changer transitions 0/579 dead transitions. [2023-08-26 07:52:21,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 579 transitions, 2347 flow [2023-08-26 07:52:21,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:52:21,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:52:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1870 transitions. [2023-08-26 07:52:21,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2023-08-26 07:52:21,801 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1870 transitions. [2023-08-26 07:52:21,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1870 transitions. [2023-08-26 07:52:21,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:52:21,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1870 transitions. [2023-08-26 07:52:21,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 311.6666666666667) internal successors, (1870), 6 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states 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:52:21,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 595.0) internal successors, (4165), 7 states have internal predecessors, (4165), 0 states have call successors, (0), 0 states 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:52:21,817 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 595.0) internal successors, (4165), 7 states have internal predecessors, (4165), 0 states have call successors, (0), 0 states 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:52:21,817 INFO L175 Difference]: Start difference. First operand has 171 places, 168 transitions, 384 flow. Second operand 6 states and 1870 transitions. [2023-08-26 07:52:21,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 579 transitions, 2347 flow [2023-08-26 07:52:21,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 579 transitions, 2333 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 07:52:21,938 INFO L231 Difference]: Finished difference. Result has 180 places, 248 transitions, 932 flow [2023-08-26 07:52:21,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=595, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=932, PETRI_PLACES=180, PETRI_TRANSITIONS=248} [2023-08-26 07:52:21,939 INFO L281 CegarLoopForPetriNet]: 160 programPoint places, 20 predicate places. [2023-08-26 07:52:21,940 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 248 transitions, 932 flow [2023-08-26 07:52:21,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 220.33333333333334) internal successors, (1322), 6 states have internal predecessors, (1322), 0 states have call successors, (0), 0 states 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:52:21,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:52:21,941 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:52:21,949 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:52:22,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:52:22,142 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-26 07:52:22,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:52:22,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1733869019, now seen corresponding path program 1 times [2023-08-26 07:52:22,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:52:22,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63091093] [2023-08-26 07:52:22,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:52:22,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:52:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:52:22,252 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:52:22,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:52:22,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63091093] [2023-08-26 07:52:22,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63091093] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:52:22,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663504612] [2023-08-26 07:52:22,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:52:22,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:52:22,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:52:22,255 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:52:22,257 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:52:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:52:22,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 07:52:22,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:52:22,357 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:52:22,357 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:52:22,400 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:52:22,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663504612] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:52:22,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:52:22,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-26 07:52:22,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252718525] [2023-08-26 07:52:22,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:52:22,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 07:52:22,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:52:22,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 07:52:22,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-26 07:52:22,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 595 [2023-08-26 07:52:22,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 248 transitions, 932 flow. Second operand has 13 states, 13 states have (on average 316.61538461538464) internal successors, (4116), 13 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states 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:52:22,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:52:22,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 595 [2023-08-26 07:52:22,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:52:23,176 INFO L124 PetriNetUnfolderBase]: 1841/6348 cut-off events. [2023-08-26 07:52:23,176 INFO L125 PetriNetUnfolderBase]: For 1189/1309 co-relation queries the response was YES. [2023-08-26 07:52:23,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12379 conditions, 6348 events. 1841/6348 cut-off events. For 1189/1309 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 57072 event pairs, 932 based on Foata normal form. 38/5728 useless extension candidates. Maximal degree in co-relation 12322. Up to 3094 conditions per place. [2023-08-26 07:52:23,211 INFO L140 encePairwiseOnDemand]: 592/595 looper letters, 87 selfloop transitions, 11 changer transitions 0/254 dead transitions. [2023-08-26 07:52:23,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 254 transitions, 1164 flow [2023-08-26 07:52:23,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 07:52:23,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 07:52:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3863 transitions. [2023-08-26 07:52:23,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5410364145658263 [2023-08-26 07:52:23,221 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3863 transitions. [2023-08-26 07:52:23,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3863 transitions. [2023-08-26 07:52:23,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:52:23,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3863 transitions. [2023-08-26 07:52:23,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 321.9166666666667) internal successors, (3863), 12 states have internal predecessors, (3863), 0 states have call successors, (0), 0 states 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:52:23,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 595.0) internal successors, (7735), 13 states have internal predecessors, (7735), 0 states have call successors, (0), 0 states 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:52:23,254 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 595.0) internal successors, (7735), 13 states have internal predecessors, (7735), 0 states have call successors, (0), 0 states 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:52:23,255 INFO L175 Difference]: Start difference. First operand has 180 places, 248 transitions, 932 flow. Second operand 12 states and 3863 transitions. [2023-08-26 07:52:23,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 254 transitions, 1164 flow [2023-08-26 07:52:23,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 254 transitions, 1164 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 07:52:23,271 INFO L231 Difference]: Finished difference. Result has 197 places, 254 transitions, 1016 flow [2023-08-26 07:52:23,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=595, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1016, PETRI_PLACES=197, PETRI_TRANSITIONS=254} [2023-08-26 07:52:23,274 INFO L281 CegarLoopForPetriNet]: 160 programPoint places, 37 predicate places. [2023-08-26 07:52:23,274 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 254 transitions, 1016 flow [2023-08-26 07:52:23,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 316.61538461538464) internal successors, (4116), 13 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states 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:52:23,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:52:23,276 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:52:23,282 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:52:23,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:52:23,482 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-26 07:52:23,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:52:23,482 INFO L85 PathProgramCache]: Analyzing trace with hash 570231963, now seen corresponding path program 2 times [2023-08-26 07:52:23,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:52:23,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114723416] [2023-08-26 07:52:23,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:52:23,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:52:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:52:23,767 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:52:23,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:52:23,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114723416] [2023-08-26 07:52:23,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114723416] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:52:23,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:52:23,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:52:23,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124640426] [2023-08-26 07:52:23,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:52:23,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 07:52:23,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:52:23,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 07:52:23,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 07:52:23,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 595 [2023-08-26 07:52:23,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 254 transitions, 1016 flow. Second operand has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states 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:52:23,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:52:23,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 595 [2023-08-26 07:52:23,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:52:25,867 INFO L124 PetriNetUnfolderBase]: 6949/15211 cut-off events. [2023-08-26 07:52:25,868 INFO L125 PetriNetUnfolderBase]: For 5313/5328 co-relation queries the response was YES. [2023-08-26 07:52:25,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36921 conditions, 15211 events. 6949/15211 cut-off events. For 5313/5328 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 124604 event pairs, 1834 based on Foata normal form. 0/13554 useless extension candidates. Maximal degree in co-relation 36839. Up to 10259 conditions per place. [2023-08-26 07:52:26,008 INFO L140 encePairwiseOnDemand]: 584/595 looper letters, 495 selfloop transitions, 26 changer transitions 2/584 dead transitions. [2023-08-26 07:52:26,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 584 transitions, 3091 flow [2023-08-26 07:52:26,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 07:52:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 07:52:26,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2526 transitions. [2023-08-26 07:52:26,015 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42453781512605043 [2023-08-26 07:52:26,016 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2526 transitions. [2023-08-26 07:52:26,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2526 transitions. [2023-08-26 07:52:26,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:52:26,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2526 transitions. [2023-08-26 07:52:26,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 252.6) internal successors, (2526), 10 states have internal predecessors, (2526), 0 states have call successors, (0), 0 states 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:52:26,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 595.0) internal successors, (6545), 11 states have internal predecessors, (6545), 0 states have call successors, (0), 0 states 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:52:26,033 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 595.0) internal successors, (6545), 11 states have internal predecessors, (6545), 0 states have call successors, (0), 0 states 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:52:26,033 INFO L175 Difference]: Start difference. First operand has 197 places, 254 transitions, 1016 flow. Second operand 10 states and 2526 transitions. [2023-08-26 07:52:26,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 584 transitions, 3091 flow [2023-08-26 07:52:26,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 584 transitions, 3043 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-26 07:52:26,074 INFO L231 Difference]: Finished difference. Result has 208 places, 282 transitions, 1178 flow [2023-08-26 07:52:26,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=595, PETRI_DIFFERENCE_MINUEND_FLOW=968, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1178, PETRI_PLACES=208, PETRI_TRANSITIONS=282} [2023-08-26 07:52:26,076 INFO L281 CegarLoopForPetriNet]: 160 programPoint places, 48 predicate places. [2023-08-26 07:52:26,076 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 282 transitions, 1178 flow [2023-08-26 07:52:26,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 213.0) internal successors, (1491), 7 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states 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:52:26,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:52:26,077 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:52:26,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 07:52:26,077 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-26 07:52:26,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:52:26,078 INFO L85 PathProgramCache]: Analyzing trace with hash 272371981, now seen corresponding path program 1 times [2023-08-26 07:52:26,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:52:26,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912444903] [2023-08-26 07:52:26,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:52:26,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:52:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:52:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:52:26,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:52:26,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912444903] [2023-08-26 07:52:26,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912444903] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:52:26,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547367953] [2023-08-26 07:52:26,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:52:26,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:52:26,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:52:26,145 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:52:26,153 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:52:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:52:26,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 07:52:26,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:52:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:52:26,263 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:52:26,281 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:52:26,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547367953] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:52:26,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:52:26,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-26 07:52:26,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207640732] [2023-08-26 07:52:26,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:52:26,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 07:52:26,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:52:26,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 07:52:26,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 07:52:26,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 595 [2023-08-26 07:52:26,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 282 transitions, 1178 flow. Second operand has 7 states, 7 states have (on average 317.7142857142857) internal successors, (2224), 7 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states 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:52:26,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:52:26,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 595 [2023-08-26 07:52:26,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:52:26,375 INFO L124 PetriNetUnfolderBase]: 77/323 cut-off events. [2023-08-26 07:52:26,375 INFO L125 PetriNetUnfolderBase]: For 363/367 co-relation queries the response was YES. [2023-08-26 07:52:26,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 947 conditions, 323 events. 77/323 cut-off events. For 363/367 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1018 event pairs, 20 based on Foata normal form. 35/346 useless extension candidates. Maximal degree in co-relation 884. Up to 153 conditions per place. [2023-08-26 07:52:26,377 INFO L140 encePairwiseOnDemand]: 592/595 looper letters, 69 selfloop transitions, 2 changer transitions 2/101 dead transitions. [2023-08-26 07:52:26,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 101 transitions, 605 flow [2023-08-26 07:52:26,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 07:52:26,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 07:52:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1308 transitions. [2023-08-26 07:52:26,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5495798319327732 [2023-08-26 07:52:26,382 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1308 transitions. [2023-08-26 07:52:26,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1308 transitions. [2023-08-26 07:52:26,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:52:26,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1308 transitions. [2023-08-26 07:52:26,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 327.0) internal successors, (1308), 4 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states 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:52:26,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 595.0) internal successors, (2975), 5 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states 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:52:26,390 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 595.0) internal successors, (2975), 5 states have internal predecessors, (2975), 0 states have call successors, (0), 0 states 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:52:26,391 INFO L175 Difference]: Start difference. First operand has 208 places, 282 transitions, 1178 flow. Second operand 4 states and 1308 transitions. [2023-08-26 07:52:26,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 101 transitions, 605 flow [2023-08-26 07:52:26,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 101 transitions, 521 flow, removed 18 selfloop flow, removed 12 redundant places. [2023-08-26 07:52:26,394 INFO L231 Difference]: Finished difference. Result has 90 places, 74 transitions, 285 flow [2023-08-26 07:52:26,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=595, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=90, PETRI_TRANSITIONS=74} [2023-08-26 07:52:26,397 INFO L281 CegarLoopForPetriNet]: 160 programPoint places, -70 predicate places. [2023-08-26 07:52:26,397 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 74 transitions, 285 flow [2023-08-26 07:52:26,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 317.7142857142857) internal successors, (2224), 7 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states 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:52:26,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:52:26,398 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:52:26,408 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:52:26,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:52:26,609 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-26 07:52:26,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:52:26,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1993692701, now seen corresponding path program 1 times [2023-08-26 07:52:26,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:52:26,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826131236] [2023-08-26 07:52:26,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:52:26,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:52:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:52:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:52:26,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:52:26,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826131236] [2023-08-26 07:52:26,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826131236] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:52:26,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341508317] [2023-08-26 07:52:26,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:52:26,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:52:26,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:52:26,852 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:52:26,855 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:52:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:52:26,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-26 07:52:26,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:52:26,967 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 7 treesize of output 6 [2023-08-26 07:52:27,045 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:52:27,045 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 07:52:27,068 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 13 treesize of output 15 [2023-08-26 07:52:27,127 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 13 treesize of output 15 [2023-08-26 07:52:27,151 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-08-26 07:52:27,176 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:52:27,177 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:52:33,211 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_385 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_385) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-26 07:52:35,223 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_385 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_385) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-26 07:52:35,315 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-26 07:52:35,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341508317] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:52:35,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:52:35,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-08-26 07:52:35,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250783719] [2023-08-26 07:52:35,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:52:35,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-26 07:52:35,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:52:35,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-26 07:52:35,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=100, Unknown=5, NotChecked=42, Total=182 [2023-08-26 07:52:35,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 595 [2023-08-26 07:52:35,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 74 transitions, 285 flow. Second operand has 14 states, 14 states have (on average 213.57142857142858) internal successors, (2990), 14 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states 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:52:35,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:52:35,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 595 [2023-08-26 07:52:35,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:52:47,375 WARN L234 SmtUtils]: Spent 10.03s on a formula simplification. DAG size of input: 23 DAG size of output: 18 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 07:52:49,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:52:51,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:52:53,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:52:55,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:52:57,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:52:59,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:53:01,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:53:03,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:53:05,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:53:07,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker 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:53:09,645 INFO L124 PetriNetUnfolderBase]: 129/377 cut-off events. [2023-08-26 07:53:09,645 INFO L125 PetriNetUnfolderBase]: For 357/359 co-relation queries the response was YES. [2023-08-26 07:53:09,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 377 events. 129/377 cut-off events. For 357/359 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1071 event pairs, 14 based on Foata normal form. 1/364 useless extension candidates. Maximal degree in co-relation 1013. Up to 213 conditions per place. [2023-08-26 07:53:09,648 INFO L140 encePairwiseOnDemand]: 587/595 looper letters, 79 selfloop transitions, 12 changer transitions 0/97 dead transitions. [2023-08-26 07:53:09,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 97 transitions, 546 flow [2023-08-26 07:53:09,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 07:53:09,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 07:53:09,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1553 transitions. [2023-08-26 07:53:09,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37286914765906365 [2023-08-26 07:53:09,653 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1553 transitions. [2023-08-26 07:53:09,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1553 transitions. [2023-08-26 07:53:09,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:53:09,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1553 transitions. [2023-08-26 07:53:09,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 221.85714285714286) internal successors, (1553), 7 states have internal predecessors, (1553), 0 states have call successors, (0), 0 states 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:53:09,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 595.0) internal successors, (4760), 8 states have internal predecessors, (4760), 0 states have call successors, (0), 0 states 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:53:09,664 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 595.0) internal successors, (4760), 8 states have internal predecessors, (4760), 0 states have call successors, (0), 0 states 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:53:09,664 INFO L175 Difference]: Start difference. First operand has 90 places, 74 transitions, 285 flow. Second operand 7 states and 1553 transitions. [2023-08-26 07:53:09,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 97 transitions, 546 flow [2023-08-26 07:53:09,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 97 transitions, 530 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 07:53:09,667 INFO L231 Difference]: Finished difference. Result has 95 places, 77 transitions, 337 flow [2023-08-26 07:53:09,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=595, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=337, PETRI_PLACES=95, PETRI_TRANSITIONS=77} [2023-08-26 07:53:09,668 INFO L281 CegarLoopForPetriNet]: 160 programPoint places, -65 predicate places. [2023-08-26 07:53:09,668 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 77 transitions, 337 flow [2023-08-26 07:53:09,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 213.57142857142858) internal successors, (2990), 14 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states 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:53:09,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:53:09,669 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, 1, 1] [2023-08-26 07:53:09,680 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:53:09,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:53:09,876 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-26 07:53:09,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:53:09,876 INFO L85 PathProgramCache]: Analyzing trace with hash -28974813, now seen corresponding path program 1 times [2023-08-26 07:53:09,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:53:09,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931532710] [2023-08-26 07:53:09,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:53:09,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:53:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:53:10,317 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:53:10,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:53:10,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931532710] [2023-08-26 07:53:10,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931532710] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:53:10,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:53:10,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:53:10,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681113490] [2023-08-26 07:53:10,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:53:10,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:53:10,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:53:10,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:53:10,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 07:53:10,321 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 595 [2023-08-26 07:53:10,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 77 transitions, 337 flow. Second operand has 6 states, 6 states have (on average 219.33333333333334) internal successors, (1316), 6 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states 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:53:10,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:53:10,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 595 [2023-08-26 07:53:10,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:53:10,446 INFO L124 PetriNetUnfolderBase]: 127/372 cut-off events. [2023-08-26 07:53:10,447 INFO L125 PetriNetUnfolderBase]: For 427/429 co-relation queries the response was YES. [2023-08-26 07:53:10,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 372 events. 127/372 cut-off events. For 427/429 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1045 event pairs, 51 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 1079. Up to 315 conditions per place. [2023-08-26 07:53:10,449 INFO L140 encePairwiseOnDemand]: 589/595 looper letters, 73 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2023-08-26 07:53:10,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 84 transitions, 535 flow [2023-08-26 07:53:10,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:53:10,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:53:10,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1351 transitions. [2023-08-26 07:53:10,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3784313725490196 [2023-08-26 07:53:10,454 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1351 transitions. [2023-08-26 07:53:10,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1351 transitions. [2023-08-26 07:53:10,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:53:10,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1351 transitions. [2023-08-26 07:53:10,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states 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:53:10,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 595.0) internal successors, (4165), 7 states have internal predecessors, (4165), 0 states have call successors, (0), 0 states 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:53:10,463 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 595.0) internal successors, (4165), 7 states have internal predecessors, (4165), 0 states have call successors, (0), 0 states 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:53:10,463 INFO L175 Difference]: Start difference. First operand has 95 places, 77 transitions, 337 flow. Second operand 6 states and 1351 transitions. [2023-08-26 07:53:10,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 84 transitions, 535 flow [2023-08-26 07:53:10,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 84 transitions, 522 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-26 07:53:10,466 INFO L231 Difference]: Finished difference. Result has 96 places, 76 transitions, 332 flow [2023-08-26 07:53:10,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=595, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=332, PETRI_PLACES=96, PETRI_TRANSITIONS=76} [2023-08-26 07:53:10,468 INFO L281 CegarLoopForPetriNet]: 160 programPoint places, -64 predicate places. [2023-08-26 07:53:10,468 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 76 transitions, 332 flow [2023-08-26 07:53:10,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.33333333333334) internal successors, (1316), 6 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states 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:53:10,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:53:10,469 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:53:10,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 07:53:10,469 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-26 07:53:10,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:53:10,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1904598833, now seen corresponding path program 1 times [2023-08-26 07:53:10,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:53:10,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025988099] [2023-08-26 07:53:10,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:53:10,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:53:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:53:10,880 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:53:10,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:53:10,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025988099] [2023-08-26 07:53:10,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025988099] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:53:10,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:53:10,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:53:10,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510338783] [2023-08-26 07:53:10,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:53:10,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:53:10,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:53:10,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:53:10,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 07:53:10,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 595 [2023-08-26 07:53:10,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 76 transitions, 332 flow. Second operand has 6 states, 6 states have (on average 221.5) internal successors, (1329), 6 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:53:10,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:53:10,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 595 [2023-08-26 07:53:10,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:53:11,029 INFO L124 PetriNetUnfolderBase]: 125/367 cut-off events. [2023-08-26 07:53:11,029 INFO L125 PetriNetUnfolderBase]: For 387/389 co-relation queries the response was YES. [2023-08-26 07:53:11,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1129 conditions, 367 events. 125/367 cut-off events. For 387/389 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1032 event pairs, 51 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 1069. Up to 315 conditions per place. [2023-08-26 07:53:11,031 INFO L140 encePairwiseOnDemand]: 589/595 looper letters, 72 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2023-08-26 07:53:11,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 83 transitions, 528 flow [2023-08-26 07:53:11,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:53:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:53:11,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1350 transitions. [2023-08-26 07:53:11,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37815126050420167 [2023-08-26 07:53:11,035 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1350 transitions. [2023-08-26 07:53:11,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1350 transitions. [2023-08-26 07:53:11,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:53:11,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1350 transitions. [2023-08-26 07:53:11,039 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 225.0) internal successors, (1350), 6 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states 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:53:11,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 595.0) internal successors, (4165), 7 states have internal predecessors, (4165), 0 states have call successors, (0), 0 states 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:53:11,044 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 595.0) internal successors, (4165), 7 states have internal predecessors, (4165), 0 states have call successors, (0), 0 states 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:53:11,044 INFO L175 Difference]: Start difference. First operand has 96 places, 76 transitions, 332 flow. Second operand 6 states and 1350 transitions. [2023-08-26 07:53:11,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 83 transitions, 528 flow [2023-08-26 07:53:11,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 83 transitions, 518 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-26 07:53:11,048 INFO L231 Difference]: Finished difference. Result has 95 places, 75 transitions, 330 flow [2023-08-26 07:53:11,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=595, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=330, PETRI_PLACES=95, PETRI_TRANSITIONS=75} [2023-08-26 07:53:11,049 INFO L281 CegarLoopForPetriNet]: 160 programPoint places, -65 predicate places. [2023-08-26 07:53:11,049 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 75 transitions, 330 flow [2023-08-26 07:53:11,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 221.5) internal successors, (1329), 6 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:53:11,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:53:11,050 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:53:11,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 07:53:11,050 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-26 07:53:11,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:53:11,050 INFO L85 PathProgramCache]: Analyzing trace with hash -245216451, now seen corresponding path program 1 times [2023-08-26 07:53:11,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:53:11,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432314667] [2023-08-26 07:53:11,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:53:11,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:53:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:53:11,641 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:53:11,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:53:11,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432314667] [2023-08-26 07:53:11,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432314667] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:53:11,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883754900] [2023-08-26 07:53:11,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:53:11,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:53:11,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:53:11,645 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:53:11,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 07:53:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:53:11,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-26 07:53:11,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:53:11,805 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 7 treesize of output 6 [2023-08-26 07:53:11,870 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:53:11,870 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 07:53:11,890 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 13 treesize of output 15 [2023-08-26 07:53:12,020 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 07:53:12,217 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 07:53:16,352 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-08-26 07:53:16,373 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:53:16,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:53:26,441 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_143| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_143|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_143| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 07:53:28,495 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_143| Int) (v_ArrVal_677 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_677)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_143|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_143| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 07:53:44,752 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_143| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_144| Int) (v_ArrVal_673 (Array Int Int)) (v_ArrVal_677 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_673) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_144| v_ArrVal_677) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_143|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_143| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_144|)))) is different from false [2023-08-26 07:53:44,886 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-26 07:53:44,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883754900] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:53:44,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:53:44,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 21 [2023-08-26 07:53:44,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828666541] [2023-08-26 07:53:44,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:53:44,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-26 07:53:44,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:53:44,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-26 07:53:44,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=283, Unknown=16, NotChecked=114, Total=506 [2023-08-26 07:53:44,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 595 [2023-08-26 07:53:44,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 75 transitions, 330 flow. Second operand has 23 states, 23 states have (on average 210.0) internal successors, (4830), 23 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states 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:53:44,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:53:44,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 595 [2023-08-26 07:53:44,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:53:45,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:46,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:48,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:52,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:53,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:54,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:55,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:56,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:03,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:04,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:05,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:06,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:07,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:10,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:11,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:12,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:13,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:14,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:15,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:16,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:17,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:18,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:20,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:21,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:22,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:23,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:24,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:44,945 INFO L124 PetriNetUnfolderBase]: 256/754 cut-off events. [2023-08-26 07:54:44,946 INFO L125 PetriNetUnfolderBase]: For 703/705 co-relation queries the response was YES. [2023-08-26 07:54:44,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2246 conditions, 754 events. 256/754 cut-off events. For 703/705 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2693 event pairs, 20 based on Foata normal form. 4/742 useless extension candidates. Maximal degree in co-relation 2186. Up to 243 conditions per place. [2023-08-26 07:54:44,949 INFO L140 encePairwiseOnDemand]: 583/595 looper letters, 145 selfloop transitions, 39 changer transitions 0/190 dead transitions. [2023-08-26 07:54:44,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 190 transitions, 1109 flow [2023-08-26 07:54:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-26 07:54:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-26 07:54:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3240 transitions. [2023-08-26 07:54:44,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3630252100840336 [2023-08-26 07:54:44,964 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3240 transitions. [2023-08-26 07:54:44,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3240 transitions. [2023-08-26 07:54:44,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:54:44,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3240 transitions. [2023-08-26 07:54:44,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 216.0) internal successors, (3240), 15 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states 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:54:44,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 595.0) internal successors, (9520), 16 states have internal predecessors, (9520), 0 states have call successors, (0), 0 states 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:54:44,982 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 595.0) internal successors, (9520), 16 states have internal predecessors, (9520), 0 states have call successors, (0), 0 states 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:54:44,982 INFO L175 Difference]: Start difference. First operand has 95 places, 75 transitions, 330 flow. Second operand 15 states and 3240 transitions. [2023-08-26 07:54:44,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 190 transitions, 1109 flow [2023-08-26 07:54:44,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 190 transitions, 1079 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-26 07:54:44,987 INFO L231 Difference]: Finished difference. Result has 113 places, 103 transitions, 646 flow [2023-08-26 07:54:44,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=595, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=646, PETRI_PLACES=113, PETRI_TRANSITIONS=103} [2023-08-26 07:54:44,988 INFO L281 CegarLoopForPetriNet]: 160 programPoint places, -47 predicate places. [2023-08-26 07:54:44,988 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 103 transitions, 646 flow [2023-08-26 07:54:44,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 210.0) internal successors, (4830), 23 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states 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:54:44,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:54:44,989 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:54:44,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-26 07:54:45,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:54:45,198 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-26 07:54:45,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:54:45,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1306892347, now seen corresponding path program 1 times [2023-08-26 07:54:45,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:54:45,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019135725] [2023-08-26 07:54:45,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:45,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:54:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:54:46,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:54:46,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019135725] [2023-08-26 07:54:46,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019135725] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:54:46,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527964969] [2023-08-26 07:54:46,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:54:46,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:54:46,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:54:46,697 INFO L229 MonitoredProcess]: Starting monitored process 9 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:54:46,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-26 07:54:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:54:46,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-26 07:54:46,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:54:46,862 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 7 treesize of output 6 [2023-08-26 07:54:46,938 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:54:46,938 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 07:54:46,968 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 13 treesize of output 15 [2023-08-26 07:54:47,124 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 07:54:47,287 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 07:54:47,329 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 07:54:50,617 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-08-26 07:54:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:54:50,642 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:55:06,581 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_147| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_147| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_147|) 0))) is different from false [2023-08-26 07:55:08,626 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_858 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_147| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_147| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_858)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_147|) 0))) is different from false [2023-08-26 07:55:08,636 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_858 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_147| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_147| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_856))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_858))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_147|) 0))) is different from false [2023-08-26 07:55:08,726 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_858 Int) (v_ArrVal_855 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_147| Int)) (or (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_855)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_856))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_858))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_147|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_147| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 07:55:08,801 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_856 (Array Int Int)) (v_ArrVal_858 Int) (v_ArrVal_855 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_147| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_148| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_147| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_148|)) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_148| v_ArrVal_855)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_856) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_148| v_ArrVal_858) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_147|) 0))) is different from false [2023-08-26 07:55:08,828 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_853 (Array Int Int)) (v_ArrVal_856 (Array Int Int)) (v_ArrVal_858 Int) (v_ArrVal_855 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_147| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_148| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_147| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_148|)) (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_853))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_148| v_ArrVal_855))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_856) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_148| v_ArrVal_858) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_147|) 0))) is different from false [2023-08-26 07:55:08,979 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-26 07:55:08,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527964969] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:55:08,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:55:08,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 27 [2023-08-26 07:55:08,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139414911] [2023-08-26 07:55:08,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:55:08,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-26 07:55:08,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:55:08,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-26 07:55:08,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=428, Unknown=16, NotChecked=282, Total=812 [2023-08-26 07:55:08,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 595 [2023-08-26 07:55:08,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 103 transitions, 646 flow. Second operand has 29 states, 29 states have (on average 203.24137931034483) internal successors, (5894), 29 states have internal predecessors, (5894), 0 states have call successors, (0), 0 states 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:55:08,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:55:08,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 595 [2023-08-26 07:55:08,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:55:10,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:55:15,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:55:30,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:55:31,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:55:42,805 WARN L234 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 65 DAG size of output: 25 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 07:56:19,089 INFO L124 PetriNetUnfolderBase]: 364/1220 cut-off events. [2023-08-26 07:56:19,089 INFO L125 PetriNetUnfolderBase]: For 2701/2701 co-relation queries the response was YES. [2023-08-26 07:56:19,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4309 conditions, 1220 events. 364/1220 cut-off events. For 2701/2701 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5942 event pairs, 40 based on Foata normal form. 2/1219 useless extension candidates. Maximal degree in co-relation 4239. Up to 232 conditions per place. [2023-08-26 07:56:19,095 INFO L140 encePairwiseOnDemand]: 572/595 looper letters, 221 selfloop transitions, 101 changer transitions 0/328 dead transitions. [2023-08-26 07:56:19,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 328 transitions, 2265 flow [2023-08-26 07:56:19,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-26 07:56:19,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-26 07:56:19,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 5647 transitions. [2023-08-26 07:56:19,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35150949268596327 [2023-08-26 07:56:19,114 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 5647 transitions. [2023-08-26 07:56:19,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 5647 transitions. [2023-08-26 07:56:19,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:56:19,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 5647 transitions. [2023-08-26 07:56:19,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 209.14814814814815) internal successors, (5647), 27 states have internal predecessors, (5647), 0 states have call successors, (0), 0 states 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:56:19,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 595.0) internal successors, (16660), 28 states have internal predecessors, (16660), 0 states have call successors, (0), 0 states 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:56:19,148 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 595.0) internal successors, (16660), 28 states have internal predecessors, (16660), 0 states have call successors, (0), 0 states 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:56:19,148 INFO L175 Difference]: Start difference. First operand has 113 places, 103 transitions, 646 flow. Second operand 27 states and 5647 transitions. [2023-08-26 07:56:19,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 328 transitions, 2265 flow [2023-08-26 07:56:19,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 328 transitions, 2125 flow, removed 44 selfloop flow, removed 3 redundant places. [2023-08-26 07:56:19,161 INFO L231 Difference]: Finished difference. Result has 146 places, 171 transitions, 1357 flow [2023-08-26 07:56:19,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=595, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1357, PETRI_PLACES=146, PETRI_TRANSITIONS=171} [2023-08-26 07:56:19,162 INFO L281 CegarLoopForPetriNet]: 160 programPoint places, -14 predicate places. [2023-08-26 07:56:19,162 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 171 transitions, 1357 flow [2023-08-26 07:56:19,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 203.24137931034483) internal successors, (5894), 29 states have internal predecessors, (5894), 0 states have call successors, (0), 0 states 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:56:19,164 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:56:19,164 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:56:19,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-26 07:56:19,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-26 07:56:19,371 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-26 07:56:19,371 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:56:19,371 INFO L85 PathProgramCache]: Analyzing trace with hash 74250481, now seen corresponding path program 2 times [2023-08-26 07:56:19,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:56:19,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240413101] [2023-08-26 07:56:19,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:56:19,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:56:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:56:19,902 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:56:19,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:56:19,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240413101] [2023-08-26 07:56:19,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240413101] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:56:19,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146126799] [2023-08-26 07:56:19,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 07:56:19,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:56:19,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:56:19,904 INFO L229 MonitoredProcess]: Starting monitored process 10 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:56:19,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-26 07:56:20,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 07:56:20,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 07:56:20,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-26 07:56:20,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:56:20,099 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 7 treesize of output 6 [2023-08-26 07:56:20,200 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:56:20,200 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 07:56:20,226 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 13 treesize of output 15 [2023-08-26 07:56:20,459 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 07:56:20,704 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 07:56:20,893 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 07:56:20,925 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-08-26 07:56:20,945 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:56:20,945 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:56:29,055 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150|) 0)))) is different from false [2023-08-26 07:56:31,113 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150| Int) (v_ArrVal_1038 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1038)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150|) 0)))) is different from false [2023-08-26 07:56:33,331 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150| Int) (v_ArrVal_1038 Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) (+ .cse0 |c_~#cache~0.offset|) v_ArrVal_1038) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150|) 0)))) (not (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) is different from false [2023-08-26 07:56:45,411 WARN L839 $PredicateComparison]: unable to prove that (and (not (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150| Int) (v_ArrVal_1034 (Array Int Int)) (v_ArrVal_1038 Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1034) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1038) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150| (+ 28 |c_~#cache~0.offset|))))) is different from false [2023-08-26 07:56:47,581 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-26 07:56:47,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146126799] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:56:47,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:56:47,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 24 [2023-08-26 07:56:47,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351161697] [2023-08-26 07:56:47,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:56:47,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-26 07:56:47,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:56:47,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-26 07:56:47,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=370, Unknown=11, NotChecked=172, Total=650 [2023-08-26 07:56:47,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 595 [2023-08-26 07:56:47,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 171 transitions, 1357 flow. Second operand has 26 states, 26 states have (on average 209.69230769230768) internal successors, (5452), 26 states have internal predecessors, (5452), 0 states have call successors, (0), 0 states 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:56:47,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:56:47,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 595 [2023-08-26 07:56:47,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:56:57,208 INFO L124 PetriNetUnfolderBase]: 409/1464 cut-off events. [2023-08-26 07:56:57,208 INFO L125 PetriNetUnfolderBase]: For 5842/5850 co-relation queries the response was YES. [2023-08-26 07:56:57,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6079 conditions, 1464 events. 409/1464 cut-off events. For 5842/5850 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7680 event pairs, 86 based on Foata normal form. 2/1461 useless extension candidates. Maximal degree in co-relation 5998. Up to 249 conditions per place. [2023-08-26 07:56:57,219 INFO L140 encePairwiseOnDemand]: 586/595 looper letters, 229 selfloop transitions, 83 changer transitions 0/318 dead transitions. [2023-08-26 07:56:57,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 318 transitions, 2845 flow [2023-08-26 07:56:57,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-26 07:56:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-26 07:56:57,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3882 transitions. [2023-08-26 07:56:57,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36246498599439775 [2023-08-26 07:56:57,224 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3882 transitions. [2023-08-26 07:56:57,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3882 transitions. [2023-08-26 07:56:57,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:56:57,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3882 transitions. [2023-08-26 07:56:57,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 215.66666666666666) internal successors, (3882), 18 states have internal predecessors, (3882), 0 states have call successors, (0), 0 states 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:56:57,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 595.0) internal successors, (11305), 19 states have internal predecessors, (11305), 0 states have call successors, (0), 0 states 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:56:57,238 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 595.0) internal successors, (11305), 19 states have internal predecessors, (11305), 0 states have call successors, (0), 0 states 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:56:57,238 INFO L175 Difference]: Start difference. First operand has 146 places, 171 transitions, 1357 flow. Second operand 18 states and 3882 transitions. [2023-08-26 07:56:57,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 318 transitions, 2845 flow [2023-08-26 07:56:57,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 318 transitions, 2681 flow, removed 54 selfloop flow, removed 6 redundant places. [2023-08-26 07:56:57,258 INFO L231 Difference]: Finished difference. Result has 160 places, 191 transitions, 1582 flow [2023-08-26 07:56:57,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=595, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1582, PETRI_PLACES=160, PETRI_TRANSITIONS=191} [2023-08-26 07:56:57,259 INFO L281 CegarLoopForPetriNet]: 160 programPoint places, 0 predicate places. [2023-08-26 07:56:57,259 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 191 transitions, 1582 flow [2023-08-26 07:56:57,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 209.69230769230768) internal successors, (5452), 26 states have internal predecessors, (5452), 0 states have call successors, (0), 0 states 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:56:57,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:56:57,260 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:56:57,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-26 07:56:57,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-26 07:56:57,465 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-26 07:56:57,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:56:57,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1036588837, now seen corresponding path program 2 times [2023-08-26 07:56:57,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:56:57,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831030388] [2023-08-26 07:56:57,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:56:57,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:56:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:57:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:57:00,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:57:00,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831030388] [2023-08-26 07:57:00,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831030388] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:57:00,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710648285] [2023-08-26 07:57:00,209 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 07:57:00,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:57:00,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:57:00,210 INFO L229 MonitoredProcess]: Starting monitored process 11 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:57:00,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-26 07:57:00,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 07:57:00,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 07:57:00,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-26 07:57:00,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:57:00,421 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 7 treesize of output 6 [2023-08-26 07:57:00,484 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:57:00,485 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 07:57:00,520 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 13 treesize of output 15 [2023-08-26 07:57:00,643 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 07:57:00,785 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 07:57:06,953 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 07:57:09,823 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-08-26 07:57:35,860 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-08-26 07:57:35,898 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:57:35,899 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:57:56,012 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155|) 0))) is different from false [2023-08-26 07:57:58,075 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1314 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1314)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155|) 0))) is different from false [2023-08-26 07:58:00,231 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1314 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156|) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| v_ArrVal_1314) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-08-26 07:58:02,249 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_71| Int)) (or (forall ((v_ArrVal_1314 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_71| 28))) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| v_ArrVal_1314) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156|)))) (< |v_t_funThread1of1ForFork0_~i~0#1_71| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2023-08-26 07:58:03,175 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_~i~0#1_71| Int) (v_ArrVal_1314 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_71| 28))) (or (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1310)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| v_ArrVal_1314) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_71| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156|)))) is different from false [2023-08-26 07:58:24,693 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1310 Int) (v_ArrVal_1314 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_157| Int)) (or (= (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1307) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_157| v_ArrVal_1310) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| v_ArrVal_1314) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_157|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156|)))) is different from false [2023-08-26 07:58:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 36 not checked. [2023-08-26 07:58:24,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710648285] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:58:24,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:58:24,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 33 [2023-08-26 07:58:24,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709366849] [2023-08-26 07:58:24,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:58:24,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-26 07:58:24,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:58:24,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-26 07:58:24,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=641, Unknown=42, NotChecked=354, Total=1190 [2023-08-26 07:58:24,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 595 [2023-08-26 07:58:24,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 191 transitions, 1582 flow. Second operand has 35 states, 35 states have (on average 204.82857142857142) internal successors, (7169), 35 states have internal predecessors, (7169), 0 states have call successors, (0), 0 states 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:58:24,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:58:24,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 595 [2023-08-26 07:58:24,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:58:26,937 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:58:28,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:30,314 WARN L539 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:58:37,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 [0] [2023-08-26 07:58:38,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:40,883 WARN L539 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:58:42,895 WARN L539 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:58:44,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:46,266 WARN L539 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:58:53,818 WARN L539 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:58:55,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:57,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 [0] [2023-08-26 07:59:04,449 WARN L539 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:59:05,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:59:07,716 WARN L539 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:59:09,735 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:59:11,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:59:13,027 WARN L539 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:59:21,770 WARN L234 SmtUtils]: Spent 6.71s on a formula simplification. DAG size of input: 42 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 07:59:28,386 WARN L234 SmtUtils]: Spent 6.59s on a formula simplification. DAG size of input: 73 DAG size of output: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 07:59:35,176 WARN L234 SmtUtils]: Spent 6.73s on a formula simplification. DAG size of input: 56 DAG size of output: 47 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 07:59:40,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:59:46,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:59:58,777 WARN L234 SmtUtils]: Spent 9.00s on a formula simplification. DAG size of input: 50 DAG size of output: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 08:00:20,457 INFO L124 PetriNetUnfolderBase]: 589/1950 cut-off events. [2023-08-26 08:00:20,457 INFO L125 PetriNetUnfolderBase]: For 9157/9175 co-relation queries the response was YES. [2023-08-26 08:00:20,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8316 conditions, 1950 events. 589/1950 cut-off events. For 9157/9175 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 9282 event pairs, 45 based on Foata normal form. 21/1967 useless extension candidates. Maximal degree in co-relation 8233. Up to 616 conditions per place. [2023-08-26 08:00:20,469 INFO L140 encePairwiseOnDemand]: 583/595 looper letters, 275 selfloop transitions, 91 changer transitions 0/372 dead transitions. [2023-08-26 08:00:20,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 372 transitions, 3343 flow [2023-08-26 08:00:20,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-26 08:00:20,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-26 08:00:20,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4830 transitions. [2023-08-26 08:00:20,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35294117647058826 [2023-08-26 08:00:20,475 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4830 transitions. [2023-08-26 08:00:20,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4830 transitions. [2023-08-26 08:00:20,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:00:20,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4830 transitions. [2023-08-26 08:00:20,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 210.0) internal successors, (4830), 23 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:00:20,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 595.0) internal successors, (14280), 24 states have internal predecessors, (14280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:00:20,489 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 595.0) internal successors, (14280), 24 states have internal predecessors, (14280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:00:20,489 INFO L175 Difference]: Start difference. First operand has 160 places, 191 transitions, 1582 flow. Second operand 23 states and 4830 transitions. [2023-08-26 08:00:20,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 372 transitions, 3343 flow [2023-08-26 08:00:20,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 372 transitions, 3280 flow, removed 3 selfloop flow, removed 7 redundant places. [2023-08-26 08:00:20,519 INFO L231 Difference]: Finished difference. Result has 182 places, 217 transitions, 2003 flow [2023-08-26 08:00:20,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=595, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2003, PETRI_PLACES=182, PETRI_TRANSITIONS=217} [2023-08-26 08:00:20,520 INFO L281 CegarLoopForPetriNet]: 160 programPoint places, 22 predicate places. [2023-08-26 08:00:20,520 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 217 transitions, 2003 flow [2023-08-26 08:00:20,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 204.82857142857142) internal successors, (7169), 35 states have internal predecessors, (7169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:00:20,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:00:20,521 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:00:20,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-26 08:00:20,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-26 08:00:20,728 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-26 08:00:20,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:00:20,728 INFO L85 PathProgramCache]: Analyzing trace with hash -77542683, now seen corresponding path program 3 times [2023-08-26 08:00:20,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:00:20,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680258887] [2023-08-26 08:00:20,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:00:20,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:00:20,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:00:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 08:00:25,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:00:25,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680258887] [2023-08-26 08:00:25,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680258887] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:00:25,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760928837] [2023-08-26 08:00:25,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 08:00:25,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:00:25,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:00:25,262 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 08:00:25,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-26 08:00:25,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 08:00:25,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 08:00:25,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 54 conjunts are in the unsatisfiable core [2023-08-26 08:00:25,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:00:25,543 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 7 treesize of output 6 [2023-08-26 08:00:25,629 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 08:00:25,629 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 08:00:25,657 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 13 treesize of output 15 [2023-08-26 08:00:25,842 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 08:00:26,056 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 08:00:26,118 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 08:00:26,415 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 08:00:26,661 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-08-26 08:00:27,023 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-08-26 08:00:27,090 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 08:00:27,090 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:00:49,213 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 08:00:51,277 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| Int) (v_ArrVal_1595 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1595)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 08:00:53,468 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1595 Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161|) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161| v_ArrVal_1595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160|) 0)))) is different from false [2023-08-26 08:01:20,897 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1595 Int) (|v_t_funThread1of1ForFork0_~i~0#1_77| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_77| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_77| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1592)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161| v_ArrVal_1595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161|)))) is different from false [2023-08-26 08:01:20,915 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1595 Int) (|v_t_funThread1of1ForFork0_~i~0#1_77| Int) (v_ArrVal_1590 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_77| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_77| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1590))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1592))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161| v_ArrVal_1595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161|)))) is different from false [2023-08-26 08:01:21,116 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1595 Int) (v_ArrVal_1589 Int) (|v_t_funThread1of1ForFork0_~i~0#1_77| Int) (v_ArrVal_1590 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_77| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_77| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select (let ((.cse1 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1589)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1590))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1592))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161| v_ArrVal_1595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161|)))) is different from false [2023-08-26 08:01:23,340 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1595 Int) (v_ArrVal_1589 Int) (|v_t_funThread1of1ForFork0_~i~0#1_77| Int) (v_ArrVal_1590 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_77| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_77| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (let ((.cse1 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) .cse1 v_ArrVal_1589)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1590) |c_~#cache~0.base|) .cse1 v_ArrVal_1592)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161| v_ArrVal_1595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161|)))) is different from false [2023-08-26 08:01:23,371 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1595 Int) (v_ArrVal_1589 Int) (|v_t_funThread1of1ForFork0_~i~0#1_77| Int) (v_ArrVal_1590 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_77| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (store (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1589)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1590) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1592) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161| v_ArrVal_1595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_77| 1) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161|)))) is different from false [2023-08-26 08:01:23,409 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1587 (Array Int Int)) (v_ArrVal_1595 Int) (v_ArrVal_1589 Int) (|v_t_funThread1of1ForFork0_~i~0#1_77| Int) (v_ArrVal_1590 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_77| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_77| 1) (= (select (store (store (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1587))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1589))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1590) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1592) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161| v_ArrVal_1595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161|)))) is different from false [2023-08-26 08:01:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 38 not checked. [2023-08-26 08:01:23,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760928837] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:01:23,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:01:23,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2023-08-26 08:01:23,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578144260] [2023-08-26 08:01:23,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:01:23,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-08-26 08:01:23,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:01:23,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-08-26 08:01:23,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=822, Unknown=29, NotChecked=612, Total=1640 [2023-08-26 08:01:23,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 595 [2023-08-26 08:01:23,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 217 transitions, 2003 flow. Second operand has 41 states, 41 states have (on average 204.1219512195122) internal successors, (8369), 41 states have internal predecessors, (8369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:01:23,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:01:23,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 595 [2023-08-26 08:01:23,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:01:38,433 WARN L234 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 71 DAG size of output: 26 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 08:01:55,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 08:02:04,437 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| Int) (v_ArrVal_1595 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1595)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_77| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_77| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161| Int) (v_ArrVal_1595 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_77| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161| v_ArrVal_1595) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_160|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_161|))))))) is different from false [2023-08-26 08:02:06,878 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 08:02:08,887 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 08:02:35,433 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 08:02:37,442 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 08:02:39,460 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 08:03:19,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 08:03:21,681 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 08:03:23,692 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 08:03:25,746 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 08:03:27,758 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 08:03:29,767 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 08:03:31,778 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 08:03:33,787 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 08:03:35,799 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 08:03:37,866 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 08:03:39,876 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 08:03:41,888 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 08:04:06,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 08:04:56,459 WARN L234 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 08:04:58,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 08:05:00,477 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 08:05:02,483 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 08:05:04,498 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 08:05:06,508 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 08:05:08,518 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 08:05:10,528 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 08:05:12,537 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 08:05:14,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 08:05:14,593 INFO L124 PetriNetUnfolderBase]: 1070/3364 cut-off events. [2023-08-26 08:05:14,593 INFO L125 PetriNetUnfolderBase]: For 26107/26115 co-relation queries the response was YES. [2023-08-26 08:05:14,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16111 conditions, 3364 events. 1070/3364 cut-off events. For 26107/26115 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 17708 event pairs, 70 based on Foata normal form. 8/3370 useless extension candidates. Maximal degree in co-relation 16021. Up to 814 conditions per place. [2023-08-26 08:05:14,611 INFO L140 encePairwiseOnDemand]: 581/595 looper letters, 428 selfloop transitions, 220 changer transitions 0/654 dead transitions. [2023-08-26 08:05:14,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 654 transitions, 6372 flow [2023-08-26 08:05:14,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-08-26 08:05:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-08-26 08:05:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 9597 transitions. [2023-08-26 08:05:14,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35063938618925833 [2023-08-26 08:05:14,622 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 9597 transitions. [2023-08-26 08:05:14,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 9597 transitions. [2023-08-26 08:05:14,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:05:14,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 9597 transitions. [2023-08-26 08:05:14,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 208.6304347826087) internal successors, (9597), 46 states have internal predecessors, (9597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:05:14,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 595.0) internal successors, (27965), 47 states have internal predecessors, (27965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:05:14,658 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 595.0) internal successors, (27965), 47 states have internal predecessors, (27965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:05:14,659 INFO L175 Difference]: Start difference. First operand has 182 places, 217 transitions, 2003 flow. Second operand 46 states and 9597 transitions. [2023-08-26 08:05:14,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 654 transitions, 6372 flow [2023-08-26 08:05:14,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 654 transitions, 5787 flow, removed 203 selfloop flow, removed 11 redundant places. [2023-08-26 08:05:14,714 INFO L231 Difference]: Finished difference. Result has 236 places, 350 transitions, 3720 flow [2023-08-26 08:05:14,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=595, PETRI_DIFFERENCE_MINUEND_FLOW=1731, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=3720, PETRI_PLACES=236, PETRI_TRANSITIONS=350} [2023-08-26 08:05:14,714 INFO L281 CegarLoopForPetriNet]: 160 programPoint places, 76 predicate places. [2023-08-26 08:05:14,715 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 350 transitions, 3720 flow [2023-08-26 08:05:14,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 204.1219512195122) internal successors, (8369), 41 states have internal predecessors, (8369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:05:14,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:05:14,716 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:05:14,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-26 08:05:14,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-26 08:05:14,923 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-26 08:05:14,924 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:05:14,924 INFO L85 PathProgramCache]: Analyzing trace with hash 206806425, now seen corresponding path program 4 times [2023-08-26 08:05:14,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:05:14,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806257380] [2023-08-26 08:05:14,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:05:14,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:05:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:05:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 08:05:16,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:05:16,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806257380] [2023-08-26 08:05:16,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806257380] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:05:16,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492502614] [2023-08-26 08:05:16,252 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 08:05:16,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:05:16,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:05:16,257 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 08:05:16,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-26 08:05:17,073 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 08:05:17,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 08:05:17,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-26 08:05:17,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:05:17,086 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 7 treesize of output 6 [2023-08-26 08:05:17,132 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 08:05:17,132 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 08:05:17,153 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 13 treesize of output 15 [2023-08-26 08:05:17,276 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 08:05:17,419 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 08:05:21,884 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 08:05:25,374 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-08-26 08:05:33,321 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 19 treesize of output 21 [2023-08-26 08:05:55,425 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-08-26 08:05:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 08:05:55,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:06:09,585 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166|) 0))) is different from false [2023-08-26 08:06:11,595 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1877 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1877) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 08:06:13,645 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1877 (Array Int Int)) (v_ArrVal_1875 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1875)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1877) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166|) 0))) is different from false [2023-08-26 08:06:13,771 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1877 (Array Int Int)) (v_ArrVal_1875 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| v_ArrVal_1875)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1877) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|)))) is different from false [2023-08-26 08:06:13,786 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_83| Int)) (or (forall ((v_ArrVal_1877 (Array Int Int)) (v_ArrVal_1875 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_83| 28))) (or (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| v_ArrVal_1875)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1877) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166| (+ 28 |c_~#cache~0.offset| .cse0))))) (< |v_t_funThread1of1ForFork0_~i~0#1_83| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2023-08-26 08:06:13,876 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1877 (Array Int Int)) (v_ArrVal_1871 Int) (|v_t_funThread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_1875 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_83| 28))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1871)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| v_ArrVal_1875))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1877) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166|) 0) (< (+ |c_~#cache~0.offset| .cse1) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166| (+ 28 |c_~#cache~0.offset| .cse1)) (< |v_t_funThread1of1ForFork0_~i~0#1_83| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2023-08-26 08:06:14,194 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1877 (Array Int Int)) (v_ArrVal_1871 Int) (v_ArrVal_1875 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168| v_ArrVal_1871) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| v_ArrVal_1875)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1877) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166|) 0))) is different from false [2023-08-26 08:06:14,238 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1868 (Array Int Int)) (v_ArrVal_1877 (Array Int Int)) (v_ArrVal_1871 Int) (v_ArrVal_1875 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168| Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1868))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168| v_ArrVal_1871) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167| v_ArrVal_1875))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1877) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_167|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_166| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_168|)))) is different from false [2023-08-26 08:06:14,480 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 38 not checked. [2023-08-26 08:06:14,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492502614] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:06:14,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:06:14,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 12] total 32 [2023-08-26 08:06:14,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650058036] [2023-08-26 08:06:14,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:06:14,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-26 08:06:14,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:06:14,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-26 08:06:14,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=512, Unknown=31, NotChecked=440, Total=1122 [2023-08-26 08:06:14,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 595 [2023-08-26 08:06:14,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 350 transitions, 3720 flow. Second operand has 34 states, 34 states have (on average 211.11764705882354) internal successors, (7178), 34 states have internal predecessors, (7178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:06:14,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:06:14,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 595 [2023-08-26 08:06:14,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:06:18,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:06:23,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Received shutdown request... [2023-08-26 08:06:24,280 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 08:06:24,280 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 08:06:25,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-26 08:06:25,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 08:06:25,314 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONASSERT (24 of 25 remaining) [2023-08-26 08:06:25,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 08:06:25,314 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-26 08:06:25,315 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2023-08-26 08:06:25,315 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2023-08-26 08:06:25,316 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2023-08-26 08:06:25,316 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (20 of 25 remaining) [2023-08-26 08:06:25,316 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2023-08-26 08:06:25,316 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2023-08-26 08:06:25,316 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2023-08-26 08:06:25,316 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONASSERT (16 of 25 remaining) [2023-08-26 08:06:25,316 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2023-08-26 08:06:25,316 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2023-08-26 08:06:25,316 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2023-08-26 08:06:25,316 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (12 of 25 remaining) [2023-08-26 08:06:25,316 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2023-08-26 08:06:25,316 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONASSERT (10 of 25 remaining) [2023-08-26 08:06:25,317 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2023-08-26 08:06:25,317 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONASSERT (8 of 25 remaining) [2023-08-26 08:06:25,317 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2023-08-26 08:06:25,317 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2023-08-26 08:06:25,317 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2023-08-26 08:06:25,317 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2023-08-26 08:06:25,317 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2023-08-26 08:06:25,317 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2023-08-26 08:06:25,317 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2023-08-26 08:06:25,317 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2023-08-26 08:06:25,318 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 08:06:25,319 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-08-26 08:06:25,321 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 08:06:25,322 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 08:06:25,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 08:06:25 BasicIcfg [2023-08-26 08:06:25,323 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 08:06:25,324 INFO L158 Benchmark]: Toolchain (without parser) took 854163.89ms. Allocated memory was 383.8MB in the beginning and 956.3MB in the end (delta: 572.5MB). Free memory was 358.7MB in the beginning and 217.4MB in the end (delta: 141.4MB). Peak memory consumption was 715.8MB. Max. memory is 16.0GB. [2023-08-26 08:06:25,324 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 383.8MB. Free memory was 360.2MB in the beginning and 360.2MB in the end (delta: 73.6kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 08:06:25,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 675.53ms. Allocated memory is still 383.8MB. Free memory was 358.4MB in the beginning and 328.2MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-26 08:06:25,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.95ms. Allocated memory is still 383.8MB. Free memory was 328.2MB in the beginning and 324.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 08:06:25,324 INFO L158 Benchmark]: Boogie Preprocessor took 76.87ms. Allocated memory is still 383.8MB. Free memory was 324.0MB in the beginning and 319.9MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 08:06:25,328 INFO L158 Benchmark]: RCFGBuilder took 714.78ms. Allocated memory is still 383.8MB. Free memory was 319.9MB in the beginning and 339.3MB in the end (delta: -19.3MB). Peak memory consumption was 19.5MB. Max. memory is 16.0GB. [2023-08-26 08:06:25,328 INFO L158 Benchmark]: TraceAbstraction took 852596.40ms. Allocated memory was 383.8MB in the beginning and 956.3MB in the end (delta: 572.5MB). Free memory was 338.5MB in the beginning and 217.4MB in the end (delta: 121.1MB). Peak memory consumption was 694.2MB. Max. memory is 16.0GB. [2023-08-26 08:06:25,332 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.15ms. Allocated memory is still 383.8MB. Free memory was 360.2MB in the beginning and 360.2MB in the end (delta: 73.6kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 675.53ms. Allocated memory is still 383.8MB. Free memory was 358.4MB in the beginning and 328.2MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 94.95ms. Allocated memory is still 383.8MB. Free memory was 328.2MB in the beginning and 324.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 76.87ms. Allocated memory is still 383.8MB. Free memory was 324.0MB in the beginning and 319.9MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 714.78ms. Allocated memory is still 383.8MB. Free memory was 319.9MB in the beginning and 339.3MB in the end (delta: -19.3MB). Peak memory consumption was 19.5MB. Max. memory is 16.0GB. * TraceAbstraction took 852596.40ms. Allocated memory was 383.8MB in the beginning and 956.3MB in the end (delta: 572.5MB). Free memory was 338.5MB in the beginning and 217.4MB in the end (delta: 121.1MB). Peak memory consumption was 694.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 736]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [736] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 324 PlacesBefore, 160 PlacesAfterwards, 369 TransitionsBefore, 197 TransitionsAfterwards, 48150 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 153 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 34 ConcurrentYvCompositions, 8 ChoiceCompositions, 226 TotalNumberOfCompositions, 190200 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 48294, independent: 46562, independent conditional: 0, independent unconditional: 46562, dependent: 1732, dependent conditional: 0, dependent unconditional: 1732, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 22135, independent: 21825, independent conditional: 0, independent unconditional: 21825, dependent: 310, dependent conditional: 0, dependent unconditional: 310, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 48294, independent: 24737, independent conditional: 0, independent unconditional: 24737, dependent: 1422, dependent conditional: 0, dependent unconditional: 1422, unknown: 22135, unknown conditional: 0, unknown unconditional: 22135] , Statistics on independence cache: Total cache size (in pairs): 2612, Positive cache size: 2411, Positive conditional cache size: 0, Positive unconditional cache size: 2411, Negative cache size: 201, Negative conditional cache size: 0, Negative unconditional cache size: 201, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 928]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 956]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 956]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 928]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 928]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 958]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 956]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 956]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 956]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 415 locations, 26 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: 852.4s, OverallIterations: 16, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 539.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 111 mSolverCounterUnknown, 3156 SdHoareTripleChecker+Valid, 169.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3156 mSDsluCounter, 1013 SdHoareTripleChecker+Invalid, 168.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8549 IncrementalHoareTripleChecker+Unchecked, 847 mSDsCounter, 351 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8279 IncrementalHoareTripleChecker+Invalid, 17290 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 351 mSolverCounterUnsat, 166 mSDtfsCounter, 8279 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1384 GetRequests, 979 SyntacticMatches, 55 SemanticMatches, 349 ConstructedPredicates, 39 IntricatePredicates, 9 DeprecatedPredicates, 4377 ImplicationChecksByTransitivity, 646.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3720occurred in iteration=15, InterpolantAutomatonStates: 192, 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.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 304.2s InterpolantComputationTime, 1239 NumberOfCodeBlocks, 1227 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1734 ConstructedInterpolants, 673 QuantifiedInterpolants, 70226 SizeOfPredicates, 107 NumberOfNonLiveVariables, 3700 ConjunctsInSsa, 310 ConjunctsInUnsatCore, 38 InterpolantComputations, 6 PerfectInterpolantSequences, 1496/1909 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