/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/pthread-ext/26_stack_cas_longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 22:12:58,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 22:12:58,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-25 22:12:58,863 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 22:12:58,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 22:12:58,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 22:12:58,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 22:12:58,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 22:12:58,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 22:12:58,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 22:12:58,885 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 22:12:58,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 22:12:58,886 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 22:12:58,886 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 22:12:58,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 22:12:58,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 22:12:58,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 22:12:58,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 22:12:58,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 22:12:58,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 22:12:58,888 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 22:12:58,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 22:12:58,889 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 22:12:58,889 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 22:12:58,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 22:12:58,890 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 22:12:58,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 22:12:58,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 22:12:58,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 22:12:58,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 22:12:58,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 22:12:58,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 22:12:58,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 22:12:58,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 22:12:58,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 22:12:58,894 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-25 22:12:59,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 22:12:59,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 22:12:59,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 22:12:59,216 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 22:12:59,216 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 22:12:59,217 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-2.i [2023-08-25 22:13:00,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 22:13:00,622 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 22:13:00,623 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-2.i [2023-08-25 22:13:00,646 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/322eb5064/f1c527ab27aa486c820d4db033bf6a0f/FLAG75243cace [2023-08-25 22:13:00,663 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/322eb5064/f1c527ab27aa486c820d4db033bf6a0f [2023-08-25 22:13:00,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 22:13:00,667 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 22:13:00,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 22:13:00,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 22:13:00,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 22:13:00,670 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 10:13:00" (1/1) ... [2023-08-25 22:13:00,671 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6456f2ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:13:00, skipping insertion in model container [2023-08-25 22:13:00,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 10:13:00" (1/1) ... [2023-08-25 22:13:00,716 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 22:13:00,953 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 22:13:00,962 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 22:13:00,980 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [254] [2023-08-25 22:13:00,982 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [254] [2023-08-25 22:13:01,008 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 22:13:01,053 INFO L206 MainTranslator]: Completed translation [2023-08-25 22:13:01,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:13:01 WrapperNode [2023-08-25 22:13:01,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 22:13:01,056 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 22:13:01,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 22:13:01,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 22:13:01,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:13:01" (1/1) ... [2023-08-25 22:13:01,095 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:13:01" (1/1) ... [2023-08-25 22:13:01,138 INFO L138 Inliner]: procedures = 177, calls = 48, calls flagged for inlining = 17, calls inlined = 20, statements flattened = 323 [2023-08-25 22:13:01,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 22:13:01,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 22:13:01,139 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 22:13:01,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 22:13:01,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:13:01" (1/1) ... [2023-08-25 22:13:01,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:13:01" (1/1) ... [2023-08-25 22:13:01,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:13:01" (1/1) ... [2023-08-25 22:13:01,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:13:01" (1/1) ... [2023-08-25 22:13:01,168 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:13:01" (1/1) ... [2023-08-25 22:13:01,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:13:01" (1/1) ... [2023-08-25 22:13:01,175 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:13:01" (1/1) ... [2023-08-25 22:13:01,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:13:01" (1/1) ... [2023-08-25 22:13:01,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 22:13:01,182 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 22:13:01,182 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 22:13:01,182 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 22:13:01,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:13:01" (1/1) ... [2023-08-25 22:13:01,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 22:13:01,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 22:13:01,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-25 22:13:01,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-25 22:13:01,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 22:13:01,280 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-25 22:13:01,285 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-25 22:13:01,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 22:13:01,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 22:13:01,286 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 22:13:01,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 22:13:01,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 22:13:01,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 22:13:01,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 22:13:01,288 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 22:13:01,455 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 22:13:01,457 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 22:13:01,992 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 22:13:02,306 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 22:13:02,307 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-25 22:13:02,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 10:13:02 BoogieIcfgContainer [2023-08-25 22:13:02,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 22:13:02,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 22:13:02,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 22:13:02,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 22:13:02,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 10:13:00" (1/3) ... [2023-08-25 22:13:02,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af83d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 10:13:02, skipping insertion in model container [2023-08-25 22:13:02,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 10:13:01" (2/3) ... [2023-08-25 22:13:02,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af83d41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 10:13:02, skipping insertion in model container [2023-08-25 22:13:02,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 10:13:02" (3/3) ... [2023-08-25 22:13:02,319 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longest-2.i [2023-08-25 22:13:02,337 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 22:13:02,337 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2023-08-25 22:13:02,337 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 22:13:02,469 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-25 22:13:02,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 182 transitions, 369 flow [2023-08-25 22:13:02,589 INFO L124 PetriNetUnfolderBase]: 11/192 cut-off events. [2023-08-25 22:13:02,590 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:13:02,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 192 events. 11/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 246 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 158. Up to 4 conditions per place. [2023-08-25 22:13:02,596 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 182 transitions, 369 flow [2023-08-25 22:13:02,603 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 182 transitions, 369 flow [2023-08-25 22:13:02,609 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 22:13:02,620 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 182 transitions, 369 flow [2023-08-25 22:13:02,623 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 182 transitions, 369 flow [2023-08-25 22:13:02,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 182 transitions, 369 flow [2023-08-25 22:13:02,678 INFO L124 PetriNetUnfolderBase]: 11/192 cut-off events. [2023-08-25 22:13:02,678 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:13:02,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 192 events. 11/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 246 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 158. Up to 4 conditions per place. [2023-08-25 22:13:02,729 INFO L119 LiptonReduction]: Number of co-enabled transitions 3796 [2023-08-25 22:13:10,081 INFO L134 LiptonReduction]: Checked pairs total: 4838 [2023-08-25 22:13:10,081 INFO L136 LiptonReduction]: Total number of compositions: 206 [2023-08-25 22:13:10,092 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 22:13:10,097 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;@77e7cb40, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 22:13:10,097 INFO L358 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2023-08-25 22:13:10,100 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 22:13:10,100 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-08-25 22:13:10,101 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:13:10,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:13:10,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-25 22:13:10,102 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err26ASSERT_VIOLATIONASSERT, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err25ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-08-25 22:13:10,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:13:10,106 INFO L85 PathProgramCache]: Analyzing trace with hash 38527557, now seen corresponding path program 1 times [2023-08-25 22:13:10,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:13:10,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138814631] [2023-08-25 22:13:10,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:13:10,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:13:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:13:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:13:10,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:13:10,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138814631] [2023-08-25 22:13:10,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138814631] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:13:10,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:13:10,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 22:13:10,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571498211] [2023-08-25 22:13:10,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:13:10,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 22:13:10,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:13:10,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 22:13:10,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 22:13:10,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 388 [2023-08-25 22:13:10,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 52 transitions, 109 flow. Second operand has 2 states, 2 states have (on average 154.0) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:10,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:13:10,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 388 [2023-08-25 22:13:10,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:13:10,422 INFO L124 PetriNetUnfolderBase]: 40/88 cut-off events. [2023-08-25 22:13:10,422 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:13:10,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 88 events. 40/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 192 event pairs, 28 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 168. Up to 88 conditions per place. [2023-08-25 22:13:10,425 INFO L140 encePairwiseOnDemand]: 359/388 looper letters, 21 selfloop transitions, 0 changer transitions 1/23 dead transitions. [2023-08-25 22:13:10,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 23 transitions, 95 flow [2023-08-25 22:13:10,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 22:13:10,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 22:13:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 355 transitions. [2023-08-25 22:13:10,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4574742268041237 [2023-08-25 22:13:10,445 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 355 transitions. [2023-08-25 22:13:10,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 355 transitions. [2023-08-25 22:13:10,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:13:10,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 355 transitions. [2023-08-25 22:13:10,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 177.5) internal successors, (355), 2 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:10,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:10,462 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 388.0) internal successors, (1164), 3 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:10,464 INFO L175 Difference]: Start difference. First operand has 49 places, 52 transitions, 109 flow. Second operand 2 states and 355 transitions. [2023-08-25 22:13:10,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 23 transitions, 95 flow [2023-08-25 22:13:10,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 23 transitions, 95 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 22:13:10,468 INFO L231 Difference]: Finished difference. Result has 23 places, 22 transitions, 49 flow [2023-08-25 22:13:10,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=49, PETRI_PLACES=23, PETRI_TRANSITIONS=22} [2023-08-25 22:13:10,475 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -26 predicate places. [2023-08-25 22:13:10,475 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 22 transitions, 49 flow [2023-08-25 22:13:10,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 154.0) internal successors, (308), 2 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:10,475 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:13:10,475 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:13:10,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 22:13:10,476 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err26ASSERT_VIOLATIONASSERT === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err26ASSERT_VIOLATIONASSERT, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err25ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-08-25 22:13:10,484 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:13:10,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1184680307, now seen corresponding path program 1 times [2023-08-25 22:13:10,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:13:10,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39848242] [2023-08-25 22:13:10,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:13:10,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:13:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:13:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:13:10,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:13:10,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39848242] [2023-08-25 22:13:10,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39848242] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:13:10,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:13:10,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:13:10,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425584871] [2023-08-25 22:13:10,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:13:10,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:13:10,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:13:10,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:13:10,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:13:10,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 388 [2023-08-25 22:13:10,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 22 transitions, 49 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:10,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:13:10,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 388 [2023-08-25 22:13:10,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:13:10,776 INFO L124 PetriNetUnfolderBase]: 35/80 cut-off events. [2023-08-25 22:13:10,776 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:13:10,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 80 events. 35/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 156 event pairs, 2 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 162. Up to 70 conditions per place. [2023-08-25 22:13:10,777 INFO L140 encePairwiseOnDemand]: 385/388 looper letters, 20 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2023-08-25 22:13:10,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 23 transitions, 95 flow [2023-08-25 22:13:10,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:13:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:13:10,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-08-25 22:13:10,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4012027491408935 [2023-08-25 22:13:10,780 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-08-25 22:13:10,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-08-25 22:13:10,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:13:10,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-08-25 22:13:10,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:10,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:10,786 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:10,786 INFO L175 Difference]: Start difference. First operand has 23 places, 22 transitions, 49 flow. Second operand 3 states and 467 transitions. [2023-08-25 22:13:10,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 23 transitions, 95 flow [2023-08-25 22:13:10,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 23 transitions, 95 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 22:13:10,787 INFO L231 Difference]: Finished difference. Result has 24 places, 21 transitions, 51 flow [2023-08-25 22:13:10,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=51, PETRI_PLACES=24, PETRI_TRANSITIONS=21} [2023-08-25 22:13:10,788 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -25 predicate places. [2023-08-25 22:13:10,788 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 21 transitions, 51 flow [2023-08-25 22:13:10,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:10,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:13:10,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:13:10,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 22:13:10,789 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err26ASSERT_VIOLATIONASSERT === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err26ASSERT_VIOLATIONASSERT, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err25ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-08-25 22:13:10,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:13:10,789 INFO L85 PathProgramCache]: Analyzing trace with hash 980766826, now seen corresponding path program 1 times [2023-08-25 22:13:10,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:13:10,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575394091] [2023-08-25 22:13:10,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:13:10,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:13:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:13:10,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:13:10,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:13:10,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575394091] [2023-08-25 22:13:10,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575394091] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:13:10,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:13:10,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 22:13:10,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484213533] [2023-08-25 22:13:10,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:13:10,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 22:13:10,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:13:10,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 22:13:10,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 22:13:10,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 388 [2023-08-25 22:13:10,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 21 transitions, 51 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:10,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:13:10,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 388 [2023-08-25 22:13:10,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:13:11,128 INFO L124 PetriNetUnfolderBase]: 61/136 cut-off events. [2023-08-25 22:13:11,129 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 22:13:11,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 136 events. 61/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 303 event pairs, 26 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 278. Up to 80 conditions per place. [2023-08-25 22:13:11,130 INFO L140 encePairwiseOnDemand]: 385/388 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-08-25 22:13:11,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 35 transitions, 147 flow [2023-08-25 22:13:11,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 22:13:11,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 22:13:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2023-08-25 22:13:11,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41408934707903783 [2023-08-25 22:13:11,132 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 482 transitions. [2023-08-25 22:13:11,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 482 transitions. [2023-08-25 22:13:11,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:13:11,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 482 transitions. [2023-08-25 22:13:11,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:11,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:11,137 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 388.0) internal successors, (1552), 4 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:11,137 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 51 flow. Second operand 3 states and 482 transitions. [2023-08-25 22:13:11,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 35 transitions, 147 flow [2023-08-25 22:13:11,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 35 transitions, 143 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 22:13:11,140 INFO L231 Difference]: Finished difference. Result has 26 places, 23 transitions, 65 flow [2023-08-25 22:13:11,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=47, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=26, PETRI_TRANSITIONS=23} [2023-08-25 22:13:11,141 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -23 predicate places. [2023-08-25 22:13:11,141 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 23 transitions, 65 flow [2023-08-25 22:13:11,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:11,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:13:11,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:13:11,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 22:13:11,142 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err26ASSERT_VIOLATIONASSERT === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err26ASSERT_VIOLATIONASSERT, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err25ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-08-25 22:13:11,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:13:11,143 INFO L85 PathProgramCache]: Analyzing trace with hash -586407218, now seen corresponding path program 1 times [2023-08-25 22:13:11,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:13:11,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204632058] [2023-08-25 22:13:11,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:13:11,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:13:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:13:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:13:12,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:13:12,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204632058] [2023-08-25 22:13:12,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204632058] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:13:12,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:13:12,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-25 22:13:12,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993679735] [2023-08-25 22:13:12,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:13:12,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-25 22:13:12,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:13:12,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-25 22:13:12,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-25 22:13:12,043 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 388 [2023-08-25 22:13:12,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 23 transitions, 65 flow. Second operand has 8 states, 8 states have (on average 87.875) internal successors, (703), 8 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:12,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:13:12,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 388 [2023-08-25 22:13:12,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:13:12,351 INFO L124 PetriNetUnfolderBase]: 101/227 cut-off events. [2023-08-25 22:13:12,351 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-25 22:13:12,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 227 events. 101/227 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 638 event pairs, 6 based on Foata normal form. 3/208 useless extension candidates. Maximal degree in co-relation 481. Up to 133 conditions per place. [2023-08-25 22:13:12,352 INFO L140 encePairwiseOnDemand]: 379/388 looper letters, 42 selfloop transitions, 16 changer transitions 0/59 dead transitions. [2023-08-25 22:13:12,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 59 transitions, 257 flow [2023-08-25 22:13:12,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 22:13:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 22:13:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 831 transitions. [2023-08-25 22:13:12,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23797250859106528 [2023-08-25 22:13:12,357 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 831 transitions. [2023-08-25 22:13:12,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 831 transitions. [2023-08-25 22:13:12,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:13:12,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 831 transitions. [2023-08-25 22:13:12,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 92.33333333333333) internal successors, (831), 9 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:12,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 388.0) internal successors, (3880), 10 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:12,366 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 388.0) internal successors, (3880), 10 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:12,366 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 65 flow. Second operand 9 states and 831 transitions. [2023-08-25 22:13:12,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 59 transitions, 257 flow [2023-08-25 22:13:12,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 59 transitions, 253 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 22:13:12,370 INFO L231 Difference]: Finished difference. Result has 37 places, 38 transitions, 168 flow [2023-08-25 22:13:12,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=168, PETRI_PLACES=37, PETRI_TRANSITIONS=38} [2023-08-25 22:13:12,371 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -12 predicate places. [2023-08-25 22:13:12,371 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 38 transitions, 168 flow [2023-08-25 22:13:12,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 87.875) internal successors, (703), 8 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:12,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:13:12,372 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:13:12,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 22:13:12,372 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err26ASSERT_VIOLATIONASSERT === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err26ASSERT_VIOLATIONASSERT, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err25ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-08-25 22:13:12,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:13:12,373 INFO L85 PathProgramCache]: Analyzing trace with hash 960672769, now seen corresponding path program 1 times [2023-08-25 22:13:12,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:13:12,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089392758] [2023-08-25 22:13:12,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:13:12,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:13:12,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:13:13,030 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-25 22:13:13,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:13:13,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089392758] [2023-08-25 22:13:13,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089392758] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 22:13:13,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353823472] [2023-08-25 22:13:13,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:13:13,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 22:13:13,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 22:13:13,035 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 22:13:13,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-25 22:13:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:13:13,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 61 conjunts are in the unsatisfiable core [2023-08-25 22:13:13,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 22:13:13,294 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-25 22:13:13,295 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-25 22:13:13,384 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-25 22:13:13,438 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 14 treesize of output 16 [2023-08-25 22:13:13,586 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-25 22:13:13,587 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 32 [2023-08-25 22:13:13,671 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-25 22:13:13,672 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 36 [2023-08-25 22:13:13,910 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-08-25 22:13:13,911 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2023-08-25 22:13:13,933 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-25 22:13:13,933 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 2 case distinctions, treesize of input 27 treesize of output 31 [2023-08-25 22:13:13,978 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 14 treesize of output 16 [2023-08-25 22:13:14,006 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-25 22:13:14,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 22:13:14,207 INFO L322 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-08-25 22:13:14,207 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 294 treesize of output 328 [2023-08-25 22:13:14,258 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:13:14,259 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 13 [2023-08-25 22:13:14,300 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-25 22:13:14,301 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 2 case distinctions, treesize of input 168 treesize of output 136 [2023-08-25 22:13:14,307 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:13:14,307 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 13 [2023-08-25 22:13:14,320 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:13:14,553 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_472 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_472) |thr1Thread1of1ForFork0_push_~#casret~0#1.base|) 0) 1) 0))) (not (= |c_ULTIMATE.start_main_~#t~0#1.base| |c_~#top~0.base|))) (forall ((|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_472 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_472))) (or (forall ((v_ArrVal_480 (Array Int Int)) (v_ArrVal_474 (Array Int Int))) (not (= (select (select (store (let ((.cse0 (store .cse1 |c_~#m~0.base| v_ArrVal_474))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_ArrVal_480) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not (= (+ (select (select .cse1 |thr1Thread1of1ForFork0_push_~#casret~0#1.base|) 0) 1) 0)))))) is different from false [2023-08-25 22:13:14,565 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:13:14,566 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2023-08-25 22:13:14,575 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:13:14,575 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 40 [2023-08-25 22:13:14,579 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-08-25 22:13:14,591 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:13:14,592 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 53 [2023-08-25 22:13:14,601 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:13:14,601 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 150 [2023-08-25 22:13:14,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2023-08-25 22:13:14,615 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-08-25 22:13:14,722 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-25 22:13:14,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353823472] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 22:13:14,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 22:13:14,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 9] total 23 [2023-08-25 22:13:14,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375554666] [2023-08-25 22:13:14,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 22:13:14,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-25 22:13:14,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:13:14,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-25 22:13:14,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=464, Unknown=3, NotChecked=44, Total=600 [2023-08-25 22:13:14,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 388 [2023-08-25 22:13:14,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 38 transitions, 168 flow. Second operand has 25 states, 25 states have (on average 85.88) internal successors, (2147), 25 states have internal predecessors, (2147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:14,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:13:14,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 388 [2023-08-25 22:13:14,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:13:20,812 INFO L124 PetriNetUnfolderBase]: 193/464 cut-off events. [2023-08-25 22:13:20,812 INFO L125 PetriNetUnfolderBase]: For 556/556 co-relation queries the response was YES. [2023-08-25 22:13:20,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1452 conditions, 464 events. 193/464 cut-off events. For 556/556 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1894 event pairs, 8 based on Foata normal form. 5/421 useless extension candidates. Maximal degree in co-relation 1441. Up to 144 conditions per place. [2023-08-25 22:13:20,818 INFO L140 encePairwiseOnDemand]: 374/388 looper letters, 89 selfloop transitions, 75 changer transitions 0/165 dead transitions. [2023-08-25 22:13:20,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 165 transitions, 1049 flow [2023-08-25 22:13:20,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-25 22:13:20,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-25 22:13:20,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 3008 transitions. [2023-08-25 22:13:20,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.22801697998787143 [2023-08-25 22:13:20,832 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 3008 transitions. [2023-08-25 22:13:20,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 3008 transitions. [2023-08-25 22:13:20,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:13:20,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 3008 transitions. [2023-08-25 22:13:20,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 88.47058823529412) internal successors, (3008), 34 states have internal predecessors, (3008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:20,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 388.0) internal successors, (13580), 35 states have internal predecessors, (13580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:20,861 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 388.0) internal successors, (13580), 35 states have internal predecessors, (13580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:20,861 INFO L175 Difference]: Start difference. First operand has 37 places, 38 transitions, 168 flow. Second operand 34 states and 3008 transitions. [2023-08-25 22:13:20,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 165 transitions, 1049 flow [2023-08-25 22:13:20,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 165 transitions, 1039 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-08-25 22:13:20,871 INFO L231 Difference]: Finished difference. Result has 90 places, 102 transitions, 787 flow [2023-08-25 22:13:20,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=787, PETRI_PLACES=90, PETRI_TRANSITIONS=102} [2023-08-25 22:13:20,873 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 41 predicate places. [2023-08-25 22:13:20,873 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 102 transitions, 787 flow [2023-08-25 22:13:20,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 85.88) internal successors, (2147), 25 states have internal predecessors, (2147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:20,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:13:20,875 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:13:20,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-25 22:13:21,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 22:13:21,081 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err26ASSERT_VIOLATIONASSERT === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err26ASSERT_VIOLATIONASSERT, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err25ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-08-25 22:13:21,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:13:21,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1046828530, now seen corresponding path program 1 times [2023-08-25 22:13:21,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:13:21,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402611624] [2023-08-25 22:13:21,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:13:21,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:13:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:13:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 22:13:21,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:13:21,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402611624] [2023-08-25 22:13:21,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402611624] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:13:21,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 22:13:21,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 22:13:21,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267480333] [2023-08-25 22:13:21,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:13:21,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 22:13:21,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:13:21,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 22:13:21,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 22:13:21,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 388 [2023-08-25 22:13:21,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 102 transitions, 787 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:21,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:13:21,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 388 [2023-08-25 22:13:21,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:13:21,496 INFO L124 PetriNetUnfolderBase]: 159/390 cut-off events. [2023-08-25 22:13:21,497 INFO L125 PetriNetUnfolderBase]: For 2818/2818 co-relation queries the response was YES. [2023-08-25 22:13:21,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1891 conditions, 390 events. 159/390 cut-off events. For 2818/2818 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1417 event pairs, 13 based on Foata normal form. 4/357 useless extension candidates. Maximal degree in co-relation 1859. Up to 334 conditions per place. [2023-08-25 22:13:21,500 INFO L140 encePairwiseOnDemand]: 384/388 looper letters, 78 selfloop transitions, 3 changer transitions 4/86 dead transitions. [2023-08-25 22:13:21,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 86 transitions, 822 flow [2023-08-25 22:13:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 22:13:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 22:13:21,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 598 transitions. [2023-08-25 22:13:21,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3853092783505155 [2023-08-25 22:13:21,504 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 598 transitions. [2023-08-25 22:13:21,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 598 transitions. [2023-08-25 22:13:21,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:13:21,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 598 transitions. [2023-08-25 22:13:21,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.5) internal successors, (598), 4 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:21,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 388.0) internal successors, (1940), 5 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:21,508 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 388.0) internal successors, (1940), 5 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:21,508 INFO L175 Difference]: Start difference. First operand has 90 places, 102 transitions, 787 flow. Second operand 4 states and 598 transitions. [2023-08-25 22:13:21,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 86 transitions, 822 flow [2023-08-25 22:13:21,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 86 transitions, 753 flow, removed 31 selfloop flow, removed 8 redundant places. [2023-08-25 22:13:21,519 INFO L231 Difference]: Finished difference. Result has 77 places, 79 transitions, 542 flow [2023-08-25 22:13:21,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=542, PETRI_PLACES=77, PETRI_TRANSITIONS=79} [2023-08-25 22:13:21,521 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 28 predicate places. [2023-08-25 22:13:21,521 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 79 transitions, 542 flow [2023-08-25 22:13:21,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:21,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:13:21,522 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:13:21,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 22:13:21,522 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err26ASSERT_VIOLATIONASSERT === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err26ASSERT_VIOLATIONASSERT, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err25ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-08-25 22:13:21,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:13:21,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1864989878, now seen corresponding path program 1 times [2023-08-25 22:13:21,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:13:21,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707714663] [2023-08-25 22:13:21,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:13:21,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:13:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:13:22,390 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-25 22:13:22,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:13:22,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707714663] [2023-08-25 22:13:22,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707714663] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 22:13:22,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298482501] [2023-08-25 22:13:22,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:13:22,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 22:13:22,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 22:13:22,392 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 22:13:22,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-25 22:13:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:13:22,700 INFO L262 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-25 22:13:22,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 22:13:22,928 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-25 22:13:22,929 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2023-08-25 22:13:22,989 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 22:13:22,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 22:13:23,141 INFO L322 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-08-25 22:13:23,141 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 307 treesize of output 336 [2023-08-25 22:13:23,181 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-08-25 22:13:23,227 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-25 22:13:23,228 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 2 case distinctions, treesize of input 168 treesize of output 141 [2023-08-25 22:13:23,237 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2023-08-25 22:13:23,247 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:13:23,247 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:13:23,399 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 22:13:23,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298482501] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 22:13:23,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 22:13:23,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 5] total 19 [2023-08-25 22:13:23,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657459014] [2023-08-25 22:13:23,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 22:13:23,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-25 22:13:23,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:13:23,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-25 22:13:23,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=358, Unknown=1, NotChecked=0, Total=420 [2023-08-25 22:13:23,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 388 [2023-08-25 22:13:23,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 542 flow. Second operand has 21 states, 21 states have (on average 89.47619047619048) internal successors, (1879), 21 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:23,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:13:23,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 388 [2023-08-25 22:13:23,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:13:25,159 INFO L124 PetriNetUnfolderBase]: 276/698 cut-off events. [2023-08-25 22:13:25,159 INFO L125 PetriNetUnfolderBase]: For 3268/3268 co-relation queries the response was YES. [2023-08-25 22:13:25,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3039 conditions, 698 events. 276/698 cut-off events. For 3268/3268 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2927 event pairs, 7 based on Foata normal form. 9/640 useless extension candidates. Maximal degree in co-relation 3012. Up to 138 conditions per place. [2023-08-25 22:13:25,164 INFO L140 encePairwiseOnDemand]: 378/388 looper letters, 76 selfloop transitions, 80 changer transitions 65/222 dead transitions. [2023-08-25 22:13:25,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 222 transitions, 1955 flow [2023-08-25 22:13:25,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-25 22:13:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-25 22:13:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 3182 transitions. [2023-08-25 22:13:25,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23431516936671576 [2023-08-25 22:13:25,174 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 3182 transitions. [2023-08-25 22:13:25,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 3182 transitions. [2023-08-25 22:13:25,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:13:25,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 3182 transitions. [2023-08-25 22:13:25,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 90.91428571428571) internal successors, (3182), 35 states have internal predecessors, (3182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:25,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 388.0) internal successors, (13968), 36 states have internal predecessors, (13968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:25,198 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 388.0) internal successors, (13968), 36 states have internal predecessors, (13968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:25,198 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 542 flow. Second operand 35 states and 3182 transitions. [2023-08-25 22:13:25,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 222 transitions, 1955 flow [2023-08-25 22:13:25,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 222 transitions, 1905 flow, removed 22 selfloop flow, removed 2 redundant places. [2023-08-25 22:13:25,208 INFO L231 Difference]: Finished difference. Result has 110 places, 100 transitions, 949 flow [2023-08-25 22:13:25,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=949, PETRI_PLACES=110, PETRI_TRANSITIONS=100} [2023-08-25 22:13:25,209 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 61 predicate places. [2023-08-25 22:13:25,209 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 100 transitions, 949 flow [2023-08-25 22:13:25,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 89.47619047619048) internal successors, (1879), 21 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:25,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:13:25,210 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:13:25,219 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-25 22:13:25,416 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,SelfDestructingSolverStorable6 [2023-08-25 22:13:25,417 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err26ASSERT_VIOLATIONASSERT === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err26ASSERT_VIOLATIONASSERT, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err25ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-08-25 22:13:25,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:13:25,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1527600340, now seen corresponding path program 1 times [2023-08-25 22:13:25,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:13:25,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436923547] [2023-08-25 22:13:25,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:13:25,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:13:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:13:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 22:13:26,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:13:26,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436923547] [2023-08-25 22:13:26,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436923547] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 22:13:26,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044086218] [2023-08-25 22:13:26,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:13:26,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 22:13:26,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 22:13:26,288 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 22:13:26,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-25 22:13:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:13:26,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-25 22:13:26,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 22:13:26,627 INFO L322 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2023-08-25 22:13:26,628 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2023-08-25 22:13:26,633 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-25 22:13:26,641 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-25 22:13:26,680 INFO L160 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:13:26,682 INFO L165 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2023-08-25 22:13:26,692 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 16 treesize of output 5 [2023-08-25 22:13:26,694 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-08-25 22:13:26,699 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2023-08-25 22:13:26,709 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-25 22:13:26,709 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 22:13:26,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044086218] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 22:13:26,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 22:13:26,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-08-25 22:13:26,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206165590] [2023-08-25 22:13:26,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 22:13:26,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 22:13:26,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:13:26,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 22:13:26,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-25 22:13:26,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 388 [2023-08-25 22:13:26,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 100 transitions, 949 flow. Second operand has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:26,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:13:26,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 388 [2023-08-25 22:13:26,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:13:26,914 INFO L124 PetriNetUnfolderBase]: 124/398 cut-off events. [2023-08-25 22:13:26,915 INFO L125 PetriNetUnfolderBase]: For 1348/1348 co-relation queries the response was YES. [2023-08-25 22:13:26,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1745 conditions, 398 events. 124/398 cut-off events. For 1348/1348 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1542 event pairs, 60 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 1715. Up to 298 conditions per place. [2023-08-25 22:13:26,918 INFO L140 encePairwiseOnDemand]: 382/388 looper letters, 52 selfloop transitions, 23 changer transitions 6/82 dead transitions. [2023-08-25 22:13:26,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 82 transitions, 905 flow [2023-08-25 22:13:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 22:13:26,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 22:13:26,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2023-08-25 22:13:26,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30670103092783507 [2023-08-25 22:13:26,921 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions. [2023-08-25 22:13:26,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions. [2023-08-25 22:13:26,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:13:26,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions. [2023-08-25 22:13:26,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:26,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 388.0) internal successors, (1940), 5 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:26,925 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 388.0) internal successors, (1940), 5 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:26,925 INFO L175 Difference]: Start difference. First operand has 110 places, 100 transitions, 949 flow. Second operand 4 states and 476 transitions. [2023-08-25 22:13:26,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 82 transitions, 905 flow [2023-08-25 22:13:26,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 82 transitions, 552 flow, removed 148 selfloop flow, removed 29 redundant places. [2023-08-25 22:13:26,934 INFO L231 Difference]: Finished difference. Result has 70 places, 74 transitions, 454 flow [2023-08-25 22:13:26,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=454, PETRI_PLACES=70, PETRI_TRANSITIONS=74} [2023-08-25 22:13:26,935 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 21 predicate places. [2023-08-25 22:13:26,935 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 74 transitions, 454 flow [2023-08-25 22:13:26,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:26,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:13:26,936 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:13:26,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-25 22:13:27,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 22:13:27,143 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err26ASSERT_VIOLATIONASSERT === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err26ASSERT_VIOLATIONASSERT, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err25ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-08-25 22:13:27,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:13:27,144 INFO L85 PathProgramCache]: Analyzing trace with hash 610956273, now seen corresponding path program 2 times [2023-08-25 22:13:27,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:13:27,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758112844] [2023-08-25 22:13:27,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:13:27,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:13:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:13:27,411 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 22:13:27,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:13:27,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758112844] [2023-08-25 22:13:27,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758112844] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 22:13:27,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972406109] [2023-08-25 22:13:27,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 22:13:27,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 22:13:27,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 22:13:27,413 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 22:13:27,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-25 22:13:27,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 22:13:27,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 22:13:27,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-25 22:13:27,762 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 22:13:27,828 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 22:13:27,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 22:13:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 22:13:27,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972406109] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 22:13:27,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 22:13:27,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-25 22:13:27,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801260653] [2023-08-25 22:13:27,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 22:13:27,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-25 22:13:27,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 22:13:27,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-25 22:13:27,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-25 22:13:27,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 388 [2023-08-25 22:13:27,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 74 transitions, 454 flow. Second operand has 8 states, 8 states have (on average 148.75) internal successors, (1190), 8 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:27,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 22:13:27,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 388 [2023-08-25 22:13:27,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 22:13:28,336 INFO L124 PetriNetUnfolderBase]: 79/280 cut-off events. [2023-08-25 22:13:28,336 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2023-08-25 22:13:28,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 280 events. 79/280 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 613 event pairs, 9 based on Foata normal form. 9/274 useless extension candidates. Maximal degree in co-relation 939. Up to 108 conditions per place. [2023-08-25 22:13:28,338 INFO L140 encePairwiseOnDemand]: 384/388 looper letters, 71 selfloop transitions, 5 changer transitions 6/83 dead transitions. [2023-08-25 22:13:28,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 83 transitions, 621 flow [2023-08-25 22:13:28,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 22:13:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 22:13:28,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1344 transitions. [2023-08-25 22:13:28,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3848797250859107 [2023-08-25 22:13:28,343 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1344 transitions. [2023-08-25 22:13:28,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1344 transitions. [2023-08-25 22:13:28,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 22:13:28,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1344 transitions. [2023-08-25 22:13:28,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 149.33333333333334) internal successors, (1344), 9 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:28,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 388.0) internal successors, (3880), 10 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:28,352 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 388.0) internal successors, (3880), 10 states have internal predecessors, (3880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:28,352 INFO L175 Difference]: Start difference. First operand has 70 places, 74 transitions, 454 flow. Second operand 9 states and 1344 transitions. [2023-08-25 22:13:28,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 83 transitions, 621 flow [2023-08-25 22:13:28,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 83 transitions, 582 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-08-25 22:13:28,355 INFO L231 Difference]: Finished difference. Result has 72 places, 59 transitions, 345 flow [2023-08-25 22:13:28,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=388, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=345, PETRI_PLACES=72, PETRI_TRANSITIONS=59} [2023-08-25 22:13:28,356 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 23 predicate places. [2023-08-25 22:13:28,357 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 59 transitions, 345 flow [2023-08-25 22:13:28,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 148.75) internal successors, (1190), 8 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 22:13:28,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 22:13:28,357 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 22:13:28,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-25 22:13:28,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 22:13:28,565 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err26ASSERT_VIOLATIONASSERT === [thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err26ASSERT_VIOLATIONASSERT, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err25ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2023-08-25 22:13:28,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 22:13:28,565 INFO L85 PathProgramCache]: Analyzing trace with hash 235004513, now seen corresponding path program 2 times [2023-08-25 22:13:28,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 22:13:28,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898569381] [2023-08-25 22:13:28,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 22:13:28,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 22:13:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 22:13:30,027 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:13:30,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 22:13:30,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898569381] [2023-08-25 22:13:30,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898569381] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 22:13:30,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436611381] [2023-08-25 22:13:30,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 22:13:30,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 22:13:30,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 22:13:30,029 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 22:13:30,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-25 22:13:30,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 22:13:30,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 22:13:30,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 914 conjuncts, 122 conjunts are in the unsatisfiable core [2023-08-25 22:13:30,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 22:13:30,393 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-25 22:13:30,393 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-25 22:13:30,471 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-25 22:13:30,522 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 14 treesize of output 16 [2023-08-25 22:13:30,661 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-25 22:13:30,661 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 32 [2023-08-25 22:13:30,731 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-25 22:13:30,731 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 36 [2023-08-25 22:13:30,935 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-08-25 22:13:30,935 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2023-08-25 22:13:30,960 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-25 22:13:30,960 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 2 case distinctions, treesize of input 27 treesize of output 31 [2023-08-25 22:13:31,132 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-25 22:13:31,133 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 32 [2023-08-25 22:13:31,212 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-25 22:13:31,213 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 36 [2023-08-25 22:13:31,408 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-08-25 22:13:31,409 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2023-08-25 22:13:31,425 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-25 22:13:31,425 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 2 case distinctions, treesize of input 27 treesize of output 31 [2023-08-25 22:13:31,586 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-25 22:13:31,586 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 32 [2023-08-25 22:13:31,650 INFO L322 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-25 22:13:31,651 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 36 [2023-08-25 22:13:31,783 INFO L322 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-08-25 22:13:31,783 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 33 [2023-08-25 22:13:31,796 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-25 22:13:31,796 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 2 case distinctions, treesize of input 27 treesize of output 31 [2023-08-25 22:13:31,835 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 14 treesize of output 16 [2023-08-25 22:13:31,872 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 22:13:31,873 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 22:13:32,021 INFO L322 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-08-25 22:13:32,021 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 294 treesize of output 328 [2023-08-25 22:13:32,062 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:13:32,063 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 13 [2023-08-25 22:13:32,104 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-25 22:13:32,104 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 2 case distinctions, treesize of input 168 treesize of output 136 [2023-08-25 22:13:32,111 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:13:32,124 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:13:32,124 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 13 [2023-08-25 22:13:32,499 INFO L322 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-08-25 22:13:32,499 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 294 treesize of output 323 [2023-08-25 22:13:32,540 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:13:32,541 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 13 [2023-08-25 22:13:32,592 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-25 22:13:32,592 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 2 case distinctions, treesize of input 163 treesize of output 136 [2023-08-25 22:13:32,605 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:13:32,605 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:13:32,609 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2023-08-25 22:13:32,901 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread1of1ForFork0_push_~#casret~0#1.base_147| Int) (v_ArrVal_2569 (Array Int Int)) (v_ArrVal_2567 (Array Int Int)) (v_ArrVal_2592 (Array Int Int)) (v_ArrVal_2580 (Array Int Int)) (v_ArrVal_2590 (Array Int Int))) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_~#m~0.base| v_ArrVal_2567))) (store .cse2 |c_~#top~0.base| (store (select .cse2 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |c_thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_ArrVal_2569))) (or (not (= (+ (select (select .cse0 |v_thr1Thread1of1ForFork0_push_~#casret~0#1.base_147|) 0) 1) 0)) (not (= (select (select (store (store (let ((.cse1 (store .cse0 |c_~#m~0.base| v_ArrVal_2580))) (store .cse1 |c_~#top~0.base| (store (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset| (+ c_~next_alloc_idx~0 2)))) |v_thr1Thread1of1ForFork0_push_~#casret~0#1.base_147| v_ArrVal_2590) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2592) |c_~#top~0.base|) |c_~#top~0.offset|) 0))))) is different from false [2023-08-25 22:13:33,279 INFO L322 Elim1Store]: treesize reduction 10, result has 70.6 percent of original size [2023-08-25 22:13:33,280 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 294 treesize of output 328 [2023-08-25 22:13:33,316 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:13:33,317 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 13 [2023-08-25 22:13:33,391 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-25 22:13:33,391 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 2 case distinctions, treesize of input 168 treesize of output 136 [2023-08-25 22:13:33,408 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:13:33,408 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 13 [2023-08-25 22:13:33,426 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 13 [2023-08-25 22:13:34,494 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread1of1ForFork0_push_~#casret~0#1.base_147| Int) (|v_thr1Thread1of1ForFork0_push_~#casret~0#1.base_149| Int) (v_ArrVal_2569 (Array Int Int)) (v_ArrVal_2557 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#casret~0#1.base| Int) (v_ArrVal_2567 (Array Int Int)) (v_ArrVal_2555 (Array Int Int)) (v_ArrVal_2564 (Array Int Int)) (v_ArrVal_2592 (Array Int Int)) (v_ArrVal_2580 (Array Int Int)) (v_ArrVal_2590 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_~#m2~0.base| v_ArrVal_2555))) (let ((.cse3 (store (let ((.cse5 (store .cse2 |c_~#m~0.base| v_ArrVal_2557))) (store .cse5 |c_~#top~0.base| (store (select .cse5 |c_~#top~0.base|) |c_~#top~0.offset| c_~next_alloc_idx~0))) |thr1Thread1of1ForFork0_push_~#casret~0#1.base| v_ArrVal_2564))) (let ((.cse1 (store (let ((.cse4 (store .cse3 |c_~#m~0.base| v_ArrVal_2567))) (store .cse4 |c_~#top~0.base| (store (select .cse4 |c_~#top~0.base|) |c_~#top~0.offset| (+ c_~next_alloc_idx~0 2)))) |v_thr1Thread1of1ForFork0_push_~#casret~0#1.base_149| v_ArrVal_2569))) (or (not (= (select (select (store (store (let ((.cse0 (store .cse1 |c_~#m~0.base| v_ArrVal_2580))) (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| (+ c_~next_alloc_idx~0 4)))) |v_thr1Thread1of1ForFork0_push_~#casret~0#1.base_147| v_ArrVal_2590) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_2592) |c_~#top~0.base|) |c_~#top~0.offset|) 0)) (not (= (+ (select (select .cse1 |v_thr1Thread1of1ForFork0_push_~#casret~0#1.base_147|) 0) 1) 0)) (not (= (+ (select (select .cse2 |thr1Thread1of1ForFork0_push_~#casret~0#1.base|) 0) 1) 0)) (not (= (+ (select (select .cse3 |v_thr1Thread1of1ForFork0_push_~#casret~0#1.base_149|) 0) 1) 0))))))) is different from false [2023-08-25 22:13:34,522 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 22:13:34,522 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 402 treesize of output 290 [2023-08-25 22:14:42,762 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-08-25 22:14:42,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-25 22:14:42,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-25 22:14:42,963 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 297367 column 7: canceled at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 297367 column 7: canceled at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1511) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:196) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:282) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:319) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 54 more [2023-08-25 22:14:42,966 INFO L158 Benchmark]: Toolchain (without parser) took 102299.85ms. Allocated memory was 335.5MB in the beginning and 14.2GB in the end (delta: 13.8GB). Free memory was 291.0MB in the beginning and 10.5GB in the end (delta: -10.2GB). Peak memory consumption was 4.4GB. Max. memory is 16.0GB. [2023-08-25 22:14:42,967 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 335.5MB. Free memory was 313.5MB in the beginning and 313.3MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 22:14:42,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.95ms. Allocated memory is still 335.5MB. Free memory was 290.6MB in the beginning and 269.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-25 22:14:42,967 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.06ms. Allocated memory is still 335.5MB. Free memory was 268.6MB in the beginning and 265.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 22:14:42,967 INFO L158 Benchmark]: Boogie Preprocessor took 42.38ms. Allocated memory is still 335.5MB. Free memory was 265.4MB in the beginning and 262.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 22:14:42,967 INFO L158 Benchmark]: RCFGBuilder took 1127.92ms. Allocated memory is still 335.5MB. Free memory was 262.3MB in the beginning and 173.1MB in the end (delta: 89.1MB). Peak memory consumption was 88.1MB. Max. memory is 16.0GB. [2023-08-25 22:14:42,968 INFO L158 Benchmark]: TraceAbstraction took 100652.75ms. Allocated memory was 335.5MB in the beginning and 14.2GB in the end (delta: 13.8GB). Free memory was 173.1MB in the beginning and 10.5GB in the end (delta: -10.3GB). Peak memory consumption was 4.3GB. Max. memory is 16.0GB. [2023-08-25 22:14:42,969 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 335.5MB. Free memory was 313.5MB in the beginning and 313.3MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 387.95ms. Allocated memory is still 335.5MB. Free memory was 290.6MB in the beginning and 269.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 82.06ms. Allocated memory is still 335.5MB. Free memory was 268.6MB in the beginning and 265.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 42.38ms. Allocated memory is still 335.5MB. Free memory was 265.4MB in the beginning and 262.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 1127.92ms. Allocated memory is still 335.5MB. Free memory was 262.3MB in the beginning and 173.1MB in the end (delta: 89.1MB). Peak memory consumption was 88.1MB. Max. memory is 16.0GB. * TraceAbstraction took 100652.75ms. Allocated memory was 335.5MB in the beginning and 14.2GB in the end (delta: 13.8GB). Free memory was 173.1MB in the beginning and 10.5GB in the end (delta: -10.3GB). Peak memory consumption was 4.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 254]: Unsoundness Warning unspecified type, defaulting to int C: short [254] - GenericResultAtLocation [Line: 254]: Unsoundness Warning unspecified type, defaulting to int C: short [254] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5s, 175 PlacesBefore, 49 PlacesAfterwards, 182 TransitionsBefore, 52 TransitionsAfterwards, 3796 CoEnabledTransitionPairs, 7 FixpointIterations, 21 TrivialSequentialCompositions, 165 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 206 TotalNumberOfCompositions, 4838 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3416, independent: 3149, independent conditional: 0, independent unconditional: 3149, dependent: 267, dependent conditional: 0, dependent unconditional: 267, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2026, independent: 1966, independent conditional: 0, independent unconditional: 1966, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3416, independent: 1183, independent conditional: 0, independent unconditional: 1183, dependent: 207, dependent conditional: 0, dependent unconditional: 207, unknown: 2026, unknown conditional: 0, unknown unconditional: 2026] , Statistics on independence cache: Total cache size (in pairs): 87, Positive cache size: 57, Positive conditional cache size: 0, Positive unconditional cache size: 57, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 297367 column 7: canceled de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 297367 column 7: canceled: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-08-25 22:14:43,181 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-25 22:14:43,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...