/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 02:39:02,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 02:39:03,013 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-24 02:39:03,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 02:39:03,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 02:39:03,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 02:39:03,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 02:39:03,047 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 02:39:03,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 02:39:03,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 02:39:03,048 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 02:39:03,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 02:39:03,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 02:39:03,049 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 02:39:03,050 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 02:39:03,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 02:39:03,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 02:39:03,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 02:39:03,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 02:39:03,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 02:39:03,052 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 02:39:03,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 02:39:03,053 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 02:39:03,053 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 02:39:03,053 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 02:39:03,054 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 02:39:03,054 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 02:39:03,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 02:39:03,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 02:39:03,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 02:39:03,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 02:39:03,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 02:39:03,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 02:39:03,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 02:39:03,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 02:39:03,057 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 [2023-08-24 02:39:03,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 02:39:03,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 02:39:03,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 02:39:03,363 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 02:39:03,364 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 02:39:03,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2023-08-24 02:39:04,617 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 02:39:04,849 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 02:39:04,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2023-08-24 02:39:04,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfa69e7e9/b551e6a7d6214490bc11711fa5a269e2/FLAG06b40ec70 [2023-08-24 02:39:04,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfa69e7e9/b551e6a7d6214490bc11711fa5a269e2 [2023-08-24 02:39:04,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 02:39:04,872 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 02:39:04,873 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 02:39:04,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 02:39:04,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 02:39:04,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 02:39:04" (1/1) ... [2023-08-24 02:39:04,876 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce4439b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:39:04, skipping insertion in model container [2023-08-24 02:39:04,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 02:39:04" (1/1) ... [2023-08-24 02:39:04,896 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 02:39:05,081 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c[2835,2848] [2023-08-24 02:39:05,094 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 02:39:05,104 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 02:39:05,137 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c[2835,2848] [2023-08-24 02:39:05,140 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 02:39:05,150 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 02:39:05,150 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 02:39:05,156 INFO L206 MainTranslator]: Completed translation [2023-08-24 02:39:05,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:39:05 WrapperNode [2023-08-24 02:39:05,158 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 02:39:05,159 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 02:39:05,159 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 02:39:05,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 02:39:05,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:39:05" (1/1) ... [2023-08-24 02:39:05,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:39:05" (1/1) ... [2023-08-24 02:39:05,222 INFO L138 Inliner]: procedures = 25, calls = 58, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 289 [2023-08-24 02:39:05,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 02:39:05,223 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 02:39:05,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 02:39:05,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 02:39:05,234 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:39:05" (1/1) ... [2023-08-24 02:39:05,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:39:05" (1/1) ... [2023-08-24 02:39:05,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:39:05" (1/1) ... [2023-08-24 02:39:05,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:39:05" (1/1) ... [2023-08-24 02:39:05,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:39:05" (1/1) ... [2023-08-24 02:39:05,257 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:39:05" (1/1) ... [2023-08-24 02:39:05,259 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:39:05" (1/1) ... [2023-08-24 02:39:05,260 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:39:05" (1/1) ... [2023-08-24 02:39:05,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 02:39:05,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 02:39:05,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 02:39:05,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 02:39:05,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:39:05" (1/1) ... [2023-08-24 02:39:05,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 02:39:05,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:39:05,306 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-24 02:39:05,312 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-24 02:39:05,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 02:39:05,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 02:39:05,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 02:39:05,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 02:39:05,340 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 02:39:05,340 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 02:39:05,340 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 02:39:05,340 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 02:39:05,340 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 02:39:05,341 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 02:39:05,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 02:39:05,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 02:39:05,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 02:39:05,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 02:39:05,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 02:39:05,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 02:39:05,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 02:39:05,343 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 02:39:05,453 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 02:39:05,454 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 02:39:05,939 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 02:39:06,171 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 02:39:06,171 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-08-24 02:39:06,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 02:39:06 BoogieIcfgContainer [2023-08-24 02:39:06,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 02:39:06,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 02:39:06,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 02:39:06,178 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 02:39:06,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 02:39:04" (1/3) ... [2023-08-24 02:39:06,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6b8452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 02:39:06, skipping insertion in model container [2023-08-24 02:39:06,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:39:05" (2/3) ... [2023-08-24 02:39:06,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c6b8452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 02:39:06, skipping insertion in model container [2023-08-24 02:39:06,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 02:39:06" (3/3) ... [2023-08-24 02:39:06,181 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2023-08-24 02:39:06,196 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 02:39:06,196 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 02:39:06,199 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 02:39:06,260 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-24 02:39:06,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 188 transitions, 400 flow [2023-08-24 02:39:06,354 INFO L124 PetriNetUnfolderBase]: 16/185 cut-off events. [2023-08-24 02:39:06,354 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 02:39:06,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 185 events. 16/185 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 126 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 147. Up to 2 conditions per place. [2023-08-24 02:39:06,362 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 188 transitions, 400 flow [2023-08-24 02:39:06,370 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 175 transitions, 368 flow [2023-08-24 02:39:06,374 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 02:39:06,385 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 175 transitions, 368 flow [2023-08-24 02:39:06,391 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 175 transitions, 368 flow [2023-08-24 02:39:06,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 175 transitions, 368 flow [2023-08-24 02:39:06,438 INFO L124 PetriNetUnfolderBase]: 16/175 cut-off events. [2023-08-24 02:39:06,438 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 02:39:06,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 175 events. 16/175 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 125 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 147. Up to 2 conditions per place. [2023-08-24 02:39:06,441 INFO L119 LiptonReduction]: Number of co-enabled transitions 1728 [2023-08-24 02:39:12,599 INFO L134 LiptonReduction]: Checked pairs total: 2271 [2023-08-24 02:39:12,599 INFO L136 LiptonReduction]: Total number of compositions: 174 [2023-08-24 02:39:12,610 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 02:39:12,616 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;@2c25a42b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 02:39:12,616 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-24 02:39:12,622 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 02:39:12,623 INFO L124 PetriNetUnfolderBase]: 5/27 cut-off events. [2023-08-24 02:39:12,623 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 02:39:12,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:39:12,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:39:12,624 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:39:12,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:39:12,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1883863174, now seen corresponding path program 1 times [2023-08-24 02:39:12,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:39:12,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984429315] [2023-08-24 02:39:12,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:39:12,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:39:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:39:13,466 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-24 02:39:13,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:39:13,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984429315] [2023-08-24 02:39:13,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984429315] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 02:39:13,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 02:39:13,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 02:39:13,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007132561] [2023-08-24 02:39:13,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:39:13,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 02:39:13,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:39:13,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 02:39:13,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 02:39:13,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 362 [2023-08-24 02:39:13,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:39:13,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:39:13,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 362 [2023-08-24 02:39:13,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:39:13,676 INFO L124 PetriNetUnfolderBase]: 438/613 cut-off events. [2023-08-24 02:39:13,676 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2023-08-24 02:39:13,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1280 conditions, 613 events. 438/613 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2026 event pairs, 247 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 986. Up to 605 conditions per place. [2023-08-24 02:39:13,682 INFO L140 encePairwiseOnDemand]: 357/362 looper letters, 24 selfloop transitions, 4 changer transitions 3/33 dead transitions. [2023-08-24 02:39:13,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 33 transitions, 146 flow [2023-08-24 02:39:13,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 02:39:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 02:39:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2023-08-24 02:39:13,698 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3751381215469613 [2023-08-24 02:39:13,698 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 679 transitions. [2023-08-24 02:39:13,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 679 transitions. [2023-08-24 02:39:13,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:39:13,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 679 transitions. [2023-08-24 02:39:13,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:39:13,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 362.0) internal successors, (2172), 6 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:39:13,718 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 362.0) internal successors, (2172), 6 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:39:13,720 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 74 flow. Second operand 5 states and 679 transitions. [2023-08-24 02:39:13,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 33 transitions, 146 flow [2023-08-24 02:39:13,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 33 transitions, 134 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-24 02:39:13,727 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 90 flow [2023-08-24 02:39:13,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=90, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2023-08-24 02:39:13,733 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2023-08-24 02:39:13,734 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 90 flow [2023-08-24 02:39:13,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:39:13,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:39:13,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:39:13,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 02:39:13,735 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:39:13,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:39:13,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1747603798, now seen corresponding path program 1 times [2023-08-24 02:39:13,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:39:13,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013256858] [2023-08-24 02:39:13,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:39:13,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:39:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:39:13,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:39:13,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:39:13,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013256858] [2023-08-24 02:39:13,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013256858] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:39:13,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284392086] [2023-08-24 02:39:13,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:39:13,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:39:13,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:39:13,870 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-24 02:39:13,908 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-24 02:39:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:39:14,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 02:39:14,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:39:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:39:14,067 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:39:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:39:14,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284392086] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 02:39:14,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 02:39:14,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-08-24 02:39:14,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162899294] [2023-08-24 02:39:14,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:39:14,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 02:39:14,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:39:14,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 02:39:14,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-24 02:39:14,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 362 [2023-08-24 02:39:14,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:39:14,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:39:14,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 362 [2023-08-24 02:39:14,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:39:14,248 INFO L124 PetriNetUnfolderBase]: 514/729 cut-off events. [2023-08-24 02:39:14,248 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-24 02:39:14,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 729 events. 514/729 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2588 event pairs, 127 based on Foata normal form. 0/512 useless extension candidates. Maximal degree in co-relation 1463. Up to 563 conditions per place. [2023-08-24 02:39:14,254 INFO L140 encePairwiseOnDemand]: 357/362 looper letters, 36 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-08-24 02:39:14,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 42 transitions, 196 flow [2023-08-24 02:39:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 02:39:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 02:39:14,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 690 transitions. [2023-08-24 02:39:14,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812154696132597 [2023-08-24 02:39:14,257 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 690 transitions. [2023-08-24 02:39:14,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 690 transitions. [2023-08-24 02:39:14,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:39:14,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 690 transitions. [2023-08-24 02:39:14,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:39:14,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 362.0) internal successors, (2172), 6 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:39:14,263 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 362.0) internal successors, (2172), 6 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:39:14,263 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 90 flow. Second operand 5 states and 690 transitions. [2023-08-24 02:39:14,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 42 transitions, 196 flow [2023-08-24 02:39:14,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 42 transitions, 186 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-24 02:39:14,265 INFO L231 Difference]: Finished difference. Result has 34 places, 31 transitions, 96 flow [2023-08-24 02:39:14,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=34, PETRI_TRANSITIONS=31} [2023-08-24 02:39:14,266 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2023-08-24 02:39:14,266 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 31 transitions, 96 flow [2023-08-24 02:39:14,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:39:14,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:39:14,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:39:14,280 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-24 02:39:14,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:39:14,474 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:39:14,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:39:14,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1434012832, now seen corresponding path program 1 times [2023-08-24 02:39:14,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:39:14,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854916596] [2023-08-24 02:39:14,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:39:14,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:39:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:39:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:39:14,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:39:14,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854916596] [2023-08-24 02:39:14,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854916596] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:39:14,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598524602] [2023-08-24 02:39:14,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:39:14,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:39:14,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:39:14,644 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-24 02:39:14,647 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-24 02:39:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:39:14,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 02:39:14,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:39:14,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:39:14,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:39:14,926 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:39:14,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598524602] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 02:39:14,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 02:39:14,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 14 [2023-08-24 02:39:14,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914523612] [2023-08-24 02:39:14,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:39:14,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 02:39:14,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:39:14,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 02:39:14,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2023-08-24 02:39:14,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 362 [2023-08-24 02:39:14,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 96 flow. Second operand has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:39:14,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:39:14,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 362 [2023-08-24 02:39:14,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:39:15,262 INFO L124 PetriNetUnfolderBase]: 690/1012 cut-off events. [2023-08-24 02:39:15,263 INFO L125 PetriNetUnfolderBase]: For 181/255 co-relation queries the response was YES. [2023-08-24 02:39:15,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2358 conditions, 1012 events. 690/1012 cut-off events. For 181/255 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3764 event pairs, 160 based on Foata normal form. 74/845 useless extension candidates. Maximal degree in co-relation 2330. Up to 380 conditions per place. [2023-08-24 02:39:15,269 INFO L140 encePairwiseOnDemand]: 351/362 looper letters, 68 selfloop transitions, 16 changer transitions 0/85 dead transitions. [2023-08-24 02:39:15,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 85 transitions, 409 flow [2023-08-24 02:39:15,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 02:39:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 02:39:15,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1055 transitions. [2023-08-24 02:39:15,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36429558011049723 [2023-08-24 02:39:15,273 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1055 transitions. [2023-08-24 02:39:15,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1055 transitions. [2023-08-24 02:39:15,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:39:15,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1055 transitions. [2023-08-24 02:39:15,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.875) internal successors, (1055), 8 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:39:15,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 362.0) internal successors, (3258), 9 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:39:15,283 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 362.0) internal successors, (3258), 9 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:39:15,283 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 96 flow. Second operand 8 states and 1055 transitions. [2023-08-24 02:39:15,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 85 transitions, 409 flow [2023-08-24 02:39:15,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 85 transitions, 389 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-24 02:39:15,286 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 192 flow [2023-08-24 02:39:15,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=192, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2023-08-24 02:39:15,286 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2023-08-24 02:39:15,287 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 192 flow [2023-08-24 02:39:15,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:39:15,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:39:15,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:39:15,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-24 02:39:15,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-24 02:39:15,494 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:39:15,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:39:15,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1945135670, now seen corresponding path program 2 times [2023-08-24 02:39:15,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:39:15,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657345824] [2023-08-24 02:39:15,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:39:15,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:39:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:39:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:39:15,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:39:15,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657345824] [2023-08-24 02:39:15,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657345824] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:39:15,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382950927] [2023-08-24 02:39:15,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 02:39:15,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:39:15,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:39:15,679 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-24 02:39:15,682 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-24 02:39:15,779 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-24 02:39:15,779 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:39:15,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 02:39:15,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:39:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 02:39:15,861 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-24 02:39:15,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382950927] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 02:39:15,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-24 02:39:15,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-08-24 02:39:15,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375980301] [2023-08-24 02:39:15,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:39:15,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 02:39:15,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:39:15,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 02:39:15,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-08-24 02:39:15,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 362 [2023-08-24 02:39:15,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:39:15,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:39:15,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 362 [2023-08-24 02:39:15,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:39:16,016 INFO L124 PetriNetUnfolderBase]: 564/822 cut-off events. [2023-08-24 02:39:16,017 INFO L125 PetriNetUnfolderBase]: For 692/748 co-relation queries the response was YES. [2023-08-24 02:39:16,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2614 conditions, 822 events. 564/822 cut-off events. For 692/748 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2947 event pairs, 198 based on Foata normal form. 98/851 useless extension candidates. Maximal degree in co-relation 2581. Up to 468 conditions per place. [2023-08-24 02:39:16,022 INFO L140 encePairwiseOnDemand]: 357/362 looper letters, 44 selfloop transitions, 6 changer transitions 0/53 dead transitions. [2023-08-24 02:39:16,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 324 flow [2023-08-24 02:39:16,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 02:39:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 02:39:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 638 transitions. [2023-08-24 02:39:16,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44060773480662985 [2023-08-24 02:39:16,024 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 638 transitions. [2023-08-24 02:39:16,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 638 transitions. [2023-08-24 02:39:16,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:39:16,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 638 transitions. [2023-08-24 02:39:16,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.5) internal successors, (638), 4 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:39:16,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 362.0) internal successors, (1810), 5 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:39:16,029 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 362.0) internal successors, (1810), 5 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:39:16,029 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 192 flow. Second operand 4 states and 638 transitions. [2023-08-24 02:39:16,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 324 flow [2023-08-24 02:39:16,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 321 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 02:39:16,033 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 208 flow [2023-08-24 02:39:16,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2023-08-24 02:39:16,034 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2023-08-24 02:39:16,034 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 208 flow [2023-08-24 02:39:16,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.5) internal successors, (622), 4 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:39:16,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:39:16,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:39:16,043 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-24 02:39:16,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:39:16,241 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:39:16,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:39:16,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1258187663, now seen corresponding path program 1 times [2023-08-24 02:39:16,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:39:16,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018000253] [2023-08-24 02:39:16,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:39:16,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:39:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:39:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 02:39:18,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:39:18,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018000253] [2023-08-24 02:39:18,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018000253] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:39:18,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351576726] [2023-08-24 02:39:18,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:39:18,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:39:18,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:39:18,323 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-24 02:39:18,325 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-24 02:39:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:39:18,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 83 conjunts are in the unsatisfiable core [2023-08-24 02:39:18,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:39:18,492 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 34 treesize of output 32 [2023-08-24 02:39:18,694 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-24 02:39:18,783 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 6 treesize of output 5 [2023-08-24 02:39:18,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:39:18,999 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 02:39:18,999 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2023-08-24 02:39:19,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:39:19,102 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 02:39:19,103 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2023-08-24 02:39:19,223 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 02:39:19,239 INFO L322 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-08-24 02:39:19,239 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 31 treesize of output 25 [2023-08-24 02:39:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 02:39:19,280 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:39:19,458 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int))) (= c_~res1~0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_237) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_238)) (.cse1 (* 4 c_~M~0))) (+ (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) c_~res2~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))))) is different from false [2023-08-24 02:39:19,469 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int))) (= (let ((.cse0 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse0)) (select (select |c_#memory_int| c_~B~0.base) (+ .cse0 c_~B~0.offset)) c_~res1~0)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_237) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_238)) (.cse2 (* 4 c_~M~0))) (+ (select (select .cse1 c_~B~0.base) (+ .cse2 c_~B~0.offset)) c_~res2~0 (select (select .cse1 c_~A~0.base) (+ c_~A~0.offset .cse2)))))) is different from false [2023-08-24 02:39:19,478 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_238 (Array Int Int)) (v_ArrVal_237 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset) c_~res1~0) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_237) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_238)) (.cse1 (* 4 c_~M~0))) (+ (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)) c_~res2~0 (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)))))) is different from false [2023-08-24 02:39:19,601 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:39:19,601 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 105 treesize of output 70 [2023-08-24 02:39:19,692 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:39:19,693 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 76790 treesize of output 64570 [2023-08-24 02:39:19,887 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:39:19,888 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 2006 treesize of output 1822 [2023-08-24 02:39:19,977 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:39:19,977 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 1814 treesize of output 1438 [2023-08-24 02:39:20,080 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:39:20,081 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 1430 treesize of output 1262 [2023-08-24 02:39:36,222 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:38,497 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:38,831 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:39,023 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:39,053 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:39,066 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:39,115 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:39,124 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:39,353 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:39,365 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:39,373 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:39,396 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:39,406 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:39,454 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:39,470 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:39,484 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:39,496 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:39,717 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:39,750 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:39,761 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:39,810 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:39,818 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:39,960 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:40,083 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 02:39:40,219 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:40,297 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:40,333 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 02:39:40,342 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 02:39:40,675 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:40,681 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:40,711 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 02:39:40,718 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:40,861 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:40,912 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:40,934 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:41,121 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:41,129 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:41,185 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:41,192 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:41,205 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:41,350 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 02:39:41,398 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-24 02:39:41,406 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 02:39:42,219 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-24 02:39:43,872 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-08-24 02:39:43,890 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:44,008 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:44,016 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:44,113 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:44,137 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:44,242 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:44,255 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:44,275 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:44,283 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:44,301 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:44,360 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:44,459 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:44,496 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:44,504 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:44,541 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:44,551 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:44,576 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:44,601 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:44,629 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:44,637 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:44,689 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:44,738 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:44,748 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:44,783 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:44,940 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:44,966 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:44,983 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:45,042 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:45,211 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:45,266 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:45,295 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:45,351 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:45,360 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:45,380 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:45,405 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:45,474 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:45,557 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:45,577 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:45,871 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:46,053 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:46,077 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:46,148 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:46,240 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:46,262 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:46,296 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:46,819 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:46,869 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:46,956 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:46,968 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:46,982 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:46,991 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:47,045 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:47,058 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:47,065 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:48,497 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:48,507 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:49,094 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:49,102 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:49,115 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:49,169 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:49,334 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:49,417 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:49,425 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:49,586 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:49,609 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:49,659 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:49,665 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:49,749 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:49,760 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:49,839 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:49,860 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:49,866 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:49,934 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:50,002 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:50,465 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:50,498 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:50,525 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:50,688 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:50,738 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:50,770 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:50,860 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:50,907 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:51,043 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:51,300 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:51,313 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:51,450 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:51,510 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:51,649 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:51,831 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:51,901 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:52,040 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:52,152 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 02:39:52,450 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:52,580 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:52,834 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:52,840 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:52,907 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:52,913 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:53,036 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 02:39:53,043 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 02:39:53,349 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:53,473 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 02:39:53,518 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:53,572 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:53,609 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:53,764 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:53,787 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:53,856 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:53,934 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 02:39:53,942 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:54,083 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:54,091 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:54,356 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:54,364 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:54,411 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:54,428 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:54,539 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:54,579 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:54,736 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:54,814 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:54,918 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 02:39:55,092 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 02:39:55,281 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 02:39:55,289 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:55,450 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 02:39:55,754 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 02:39:55,854 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 02:39:55,861 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 02:39:56,163 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:56,286 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 02:39:56,382 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-08-24 02:39:56,412 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 02:39:57,113 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-24 02:39:57,130 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 02:39:57,824 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-24 02:39:58,044 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:39:58,050 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:58,257 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:58,384 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:39:58,410 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:58,420 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:58,458 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:58,466 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:58,497 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:58,510 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:39:58,682 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:58,885 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:59,129 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:39:59,140 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:39:59,995 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:00,019 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:05,415 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:05,956 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:05,968 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:06,021 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:06,079 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:06,882 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:06,986 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:06,998 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:07,029 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:07,045 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:07,077 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:07,278 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:07,291 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:07,366 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:40:07,379 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:07,510 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:07,801 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:07,876 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:07,906 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:08,393 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:08,404 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:08,414 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:08,554 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:08,581 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:08,898 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:09,067 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:09,259 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:09,360 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:09,374 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:09,388 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:09,400 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:09,442 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:09,456 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:09,537 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:09,550 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:09,563 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:09,570 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:09,715 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:09,835 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:09,843 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:09,884 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:09,892 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:09,922 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:09,930 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:10,346 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:10,435 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:40:10,455 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:10,507 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:10,534 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:10,577 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:40:10,709 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 02:40:10,763 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:40:10,785 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:11,236 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:11,391 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:40:11,402 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:11,466 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:11,605 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:11,665 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:40:11,797 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 02:40:12,098 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 02:40:12,220 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:40:12,354 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:12,607 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 02:40:12,897 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 02:40:12,916 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 02:40:12,924 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:40:13,115 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 02:40:13,796 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-24 02:40:13,851 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-08-24 02:40:13,861 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-08-24 02:40:15,569 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 02:40:15,867 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-08-24 02:40:15,886 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 02:40:15,893 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:40:16,037 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:40:16,051 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:16,089 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:40:16,222 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:16,364 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:40:16,499 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:16,635 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 02:40:16,955 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:40:17,173 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:17,245 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:17,272 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:17,330 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:17,349 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:17,363 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:17,397 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:17,434 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:17,558 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:17,573 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:17,692 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-08-24 02:40:17,701 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:40:18,023 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:18,215 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:40:18,243 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:18,252 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:18,298 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:18,308 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:18,349 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:18,369 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:18,600 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:18,847 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:19,155 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:19,162 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:19,247 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:19,255 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:19,282 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:19,400 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:19,464 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:19,482 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:19,493 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:19,507 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:19,566 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:19,575 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:19,582 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:19,671 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:19,696 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:19,705 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:19,762 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:19,778 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:19,793 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:19,891 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:19,917 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:19,945 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:19,973 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:20,008 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:20,039 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:20,144 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:20,153 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:20,197 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:20,232 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:20,281 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:40:20,292 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:20,370 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:20,523 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:20,537 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:20,544 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:20,585 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:20,636 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-08-24 02:40:20,656 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:20,680 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:20,695 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:20,719 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-08-24 02:40:20,738 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-08-24 02:40:20,744 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:20,956 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-08-24 02:40:20,966 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-08-24 02:40:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-24 02:40:38,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351576726] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:40:38,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:40:38,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2023-08-24 02:40:38,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463680286] [2023-08-24 02:40:38,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:40:38,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-24 02:40:38,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:40:38,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-24 02:40:38,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=930, Unknown=17, NotChecked=192, Total=1260 [2023-08-24 02:40:38,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 362 [2023-08-24 02:40:38,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 208 flow. Second operand has 36 states, 36 states have (on average 87.66666666666667) internal successors, (3156), 36 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:40:38,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:40:38,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 362 [2023-08-24 02:40:38,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:40:41,919 INFO L124 PetriNetUnfolderBase]: 2447/3530 cut-off events. [2023-08-24 02:40:41,919 INFO L125 PetriNetUnfolderBase]: For 5081/5137 co-relation queries the response was YES. [2023-08-24 02:40:41,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12377 conditions, 3530 events. 2447/3530 cut-off events. For 5081/5137 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 16438 event pairs, 161 based on Foata normal form. 30/3296 useless extension candidates. Maximal degree in co-relation 10049. Up to 1333 conditions per place. [2023-08-24 02:40:41,947 INFO L140 encePairwiseOnDemand]: 348/362 looper letters, 217 selfloop transitions, 97 changer transitions 2/318 dead transitions. [2023-08-24 02:40:41,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 318 transitions, 2133 flow [2023-08-24 02:40:41,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-24 02:40:41,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-08-24 02:40:41,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2480 transitions. [2023-08-24 02:40:41,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2634934126646834 [2023-08-24 02:40:41,955 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2480 transitions. [2023-08-24 02:40:41,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2480 transitions. [2023-08-24 02:40:41,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:40:41,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2480 transitions. [2023-08-24 02:40:41,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 95.38461538461539) internal successors, (2480), 26 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:40:41,971 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 362.0) internal successors, (9774), 27 states have internal predecessors, (9774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:40:41,973 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 362.0) internal successors, (9774), 27 states have internal predecessors, (9774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:40:41,973 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 208 flow. Second operand 26 states and 2480 transitions. [2023-08-24 02:40:41,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 318 transitions, 2133 flow [2023-08-24 02:40:41,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 318 transitions, 2035 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-24 02:40:42,000 INFO L231 Difference]: Finished difference. Result has 77 places, 140 transitions, 1102 flow [2023-08-24 02:40:42,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1102, PETRI_PLACES=77, PETRI_TRANSITIONS=140} [2023-08-24 02:40:42,002 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 44 predicate places. [2023-08-24 02:40:42,002 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 140 transitions, 1102 flow [2023-08-24 02:40:42,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 87.66666666666667) internal successors, (3156), 36 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:40:42,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:40:42,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:40:42,011 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-24 02:40:42,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:40:42,210 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:40:42,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:40:42,211 INFO L85 PathProgramCache]: Analyzing trace with hash -2000448063, now seen corresponding path program 2 times [2023-08-24 02:40:42,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:40:42,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498926471] [2023-08-24 02:40:42,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:40:42,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:40:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:40:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:40:43,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:40:43,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498926471] [2023-08-24 02:40:43,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498926471] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:40:43,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755346864] [2023-08-24 02:40:43,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 02:40:43,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:40:43,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:40:43,116 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-24 02:40:43,149 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-24 02:40:43,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 02:40:43,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:40:43,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 54 conjunts are in the unsatisfiable core [2023-08-24 02:40:43,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:40:43,555 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 02:40:43,578 INFO L322 Elim1Store]: treesize reduction 45, result has 31.8 percent of original size [2023-08-24 02:40:43,579 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 33 treesize of output 31 [2023-08-24 02:40:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:40:43,615 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:40:43,718 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:40:43,718 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 33 treesize of output 78 [2023-08-24 02:40:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:40:43,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755346864] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:40:43,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:40:43,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 25 [2023-08-24 02:40:43,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429954016] [2023-08-24 02:40:43,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:40:43,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-24 02:40:43,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:40:43,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-24 02:40:43,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2023-08-24 02:40:43,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 362 [2023-08-24 02:40:43,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 140 transitions, 1102 flow. Second operand has 27 states, 27 states have (on average 98.48148148148148) internal successors, (2659), 27 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:40:43,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:40:43,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 362 [2023-08-24 02:40:43,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:40:47,037 INFO L124 PetriNetUnfolderBase]: 3929/5670 cut-off events. [2023-08-24 02:40:47,037 INFO L125 PetriNetUnfolderBase]: For 14053/14053 co-relation queries the response was YES. [2023-08-24 02:40:47,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23535 conditions, 5670 events. 3929/5670 cut-off events. For 14053/14053 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 27330 event pairs, 447 based on Foata normal form. 1/5670 useless extension candidates. Maximal degree in co-relation 21347. Up to 2769 conditions per place. [2023-08-24 02:40:47,089 INFO L140 encePairwiseOnDemand]: 346/362 looper letters, 227 selfloop transitions, 289 changer transitions 1/517 dead transitions. [2023-08-24 02:40:47,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 517 transitions, 4517 flow [2023-08-24 02:40:47,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-08-24 02:40:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-08-24 02:40:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 4339 transitions. [2023-08-24 02:40:47,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2853854248881873 [2023-08-24 02:40:47,103 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 4339 transitions. [2023-08-24 02:40:47,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 4339 transitions. [2023-08-24 02:40:47,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:40:47,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 4339 transitions. [2023-08-24 02:40:47,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 103.30952380952381) internal successors, (4339), 42 states have internal predecessors, (4339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:40:47,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 362.0) internal successors, (15566), 43 states have internal predecessors, (15566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:40:47,133 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 362.0) internal successors, (15566), 43 states have internal predecessors, (15566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:40:47,133 INFO L175 Difference]: Start difference. First operand has 77 places, 140 transitions, 1102 flow. Second operand 42 states and 4339 transitions. [2023-08-24 02:40:47,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 517 transitions, 4517 flow [2023-08-24 02:40:47,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 517 transitions, 4449 flow, removed 30 selfloop flow, removed 2 redundant places. [2023-08-24 02:40:47,221 INFO L231 Difference]: Finished difference. Result has 137 places, 371 transitions, 3937 flow [2023-08-24 02:40:47,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=3937, PETRI_PLACES=137, PETRI_TRANSITIONS=371} [2023-08-24 02:40:47,222 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 104 predicate places. [2023-08-24 02:40:47,222 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 371 transitions, 3937 flow [2023-08-24 02:40:47,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 98.48148148148148) internal successors, (2659), 27 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:40:47,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:40:47,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:40:47,233 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-24 02:40:47,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:40:47,429 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:40:47,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:40:47,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1652253555, now seen corresponding path program 3 times [2023-08-24 02:40:47,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:40:47,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702827827] [2023-08-24 02:40:47,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:40:47,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:40:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:40:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 02:40:48,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:40:48,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702827827] [2023-08-24 02:40:48,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702827827] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:40:48,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251277251] [2023-08-24 02:40:48,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 02:40:48,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:40:48,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:40:48,693 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:40:48,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 02:40:48,835 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-24 02:40:48,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:40:48,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 62 conjunts are in the unsatisfiable core [2023-08-24 02:40:48,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:40:49,147 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 02:40:49,161 INFO L322 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-08-24 02:40:49,163 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 31 treesize of output 25 [2023-08-24 02:40:49,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:40:49,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:40:49,260 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:40:49,260 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 41 treesize of output 86 [2023-08-24 02:40:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:40:49,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251277251] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:40:49,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:40:49,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 28 [2023-08-24 02:40:49,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747023539] [2023-08-24 02:40:49,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:40:49,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-24 02:40:49,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:40:49,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-24 02:40:49,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2023-08-24 02:40:49,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 362 [2023-08-24 02:40:49,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 371 transitions, 3937 flow. Second operand has 30 states, 30 states have (on average 85.13333333333334) internal successors, (2554), 30 states have internal predecessors, (2554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:40:49,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:40:49,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 362 [2023-08-24 02:40:49,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:40:52,623 INFO L124 PetriNetUnfolderBase]: 4993/7272 cut-off events. [2023-08-24 02:40:52,623 INFO L125 PetriNetUnfolderBase]: For 49686/49686 co-relation queries the response was YES. [2023-08-24 02:40:52,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40628 conditions, 7272 events. 4993/7272 cut-off events. For 49686/49686 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 37436 event pairs, 645 based on Foata normal form. 2/7274 useless extension candidates. Maximal degree in co-relation 38320. Up to 4351 conditions per place. [2023-08-24 02:40:52,698 INFO L140 encePairwiseOnDemand]: 346/362 looper letters, 403 selfloop transitions, 505 changer transitions 2/910 dead transitions. [2023-08-24 02:40:52,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 910 transitions, 11035 flow [2023-08-24 02:40:52,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-24 02:40:52,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-08-24 02:40:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 3539 transitions. [2023-08-24 02:40:52,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25067289984417057 [2023-08-24 02:40:52,706 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 3539 transitions. [2023-08-24 02:40:52,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 3539 transitions. [2023-08-24 02:40:52,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:40:52,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 3539 transitions. [2023-08-24 02:40:52,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 90.74358974358974) internal successors, (3539), 39 states have internal predecessors, (3539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:40:52,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 362.0) internal successors, (14480), 40 states have internal predecessors, (14480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:40:52,732 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 362.0) internal successors, (14480), 40 states have internal predecessors, (14480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:40:52,733 INFO L175 Difference]: Start difference. First operand has 137 places, 371 transitions, 3937 flow. Second operand 39 states and 3539 transitions. [2023-08-24 02:40:52,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 910 transitions, 11035 flow [2023-08-24 02:40:53,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 910 transitions, 10230 flow, removed 397 selfloop flow, removed 3 redundant places. [2023-08-24 02:40:53,082 INFO L231 Difference]: Finished difference. Result has 193 places, 686 transitions, 8971 flow [2023-08-24 02:40:53,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=3662, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=8971, PETRI_PLACES=193, PETRI_TRANSITIONS=686} [2023-08-24 02:40:53,083 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 160 predicate places. [2023-08-24 02:40:53,083 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 686 transitions, 8971 flow [2023-08-24 02:40:53,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 85.13333333333334) internal successors, (2554), 30 states have internal predecessors, (2554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:40:53,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:40:53,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:40:53,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 02:40:53,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:40:53,290 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:40:53,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:40:53,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1109560275, now seen corresponding path program 4 times [2023-08-24 02:40:53,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:40:53,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196221216] [2023-08-24 02:40:53,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:40:53,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:40:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:40:54,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 02:40:54,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:40:54,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196221216] [2023-08-24 02:40:54,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196221216] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:40:54,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754808348] [2023-08-24 02:40:54,476 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 02:40:54,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:40:54,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:40:54,477 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:40:54,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 02:40:54,601 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 02:40:54,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:40:54,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 60 conjunts are in the unsatisfiable core [2023-08-24 02:40:54,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:40:54,959 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:40:54,959 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 27 treesize of output 19 [2023-08-24 02:40:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:40:54,968 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:40:55,072 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:40:55,073 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 41 treesize of output 86 [2023-08-24 02:40:55,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:40:55,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754808348] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:40:55,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:40:55,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 28 [2023-08-24 02:40:55,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315596629] [2023-08-24 02:40:55,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:40:55,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-24 02:40:55,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:40:55,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-24 02:40:55,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=777, Unknown=0, NotChecked=0, Total=870 [2023-08-24 02:40:55,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 362 [2023-08-24 02:40:55,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 686 transitions, 8971 flow. Second operand has 30 states, 30 states have (on average 85.1) internal successors, (2553), 30 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:40:55,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:40:55,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 362 [2023-08-24 02:40:55,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:40:59,465 INFO L124 PetriNetUnfolderBase]: 6148/8915 cut-off events. [2023-08-24 02:40:59,465 INFO L125 PetriNetUnfolderBase]: For 87133/87133 co-relation queries the response was YES. [2023-08-24 02:40:59,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58772 conditions, 8915 events. 6148/8915 cut-off events. For 87133/87133 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 47221 event pairs, 998 based on Foata normal form. 2/8917 useless extension candidates. Maximal degree in co-relation 58211. Up to 5796 conditions per place. [2023-08-24 02:40:59,550 INFO L140 encePairwiseOnDemand]: 347/362 looper letters, 425 selfloop transitions, 652 changer transitions 1/1078 dead transitions. [2023-08-24 02:40:59,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 1078 transitions, 15498 flow [2023-08-24 02:40:59,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-08-24 02:40:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2023-08-24 02:40:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 4578 transitions. [2023-08-24 02:40:59,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2479688007799805 [2023-08-24 02:40:59,558 INFO L72 ComplementDD]: Start complementDD. Operand 51 states and 4578 transitions. [2023-08-24 02:40:59,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 4578 transitions. [2023-08-24 02:40:59,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:40:59,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 51 states and 4578 transitions. [2023-08-24 02:40:59,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 52 states, 51 states have (on average 89.76470588235294) internal successors, (4578), 51 states have internal predecessors, (4578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:40:59,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 52 states, 52 states have (on average 362.0) internal successors, (18824), 52 states have internal predecessors, (18824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:40:59,590 INFO L81 ComplementDD]: Finished complementDD. Result has 52 states, 52 states have (on average 362.0) internal successors, (18824), 52 states have internal predecessors, (18824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:40:59,590 INFO L175 Difference]: Start difference. First operand has 193 places, 686 transitions, 8971 flow. Second operand 51 states and 4578 transitions. [2023-08-24 02:40:59,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 1078 transitions, 15498 flow [2023-08-24 02:41:00,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 1078 transitions, 14741 flow, removed 106 selfloop flow, removed 7 redundant places. [2023-08-24 02:41:00,255 INFO L231 Difference]: Finished difference. Result has 246 places, 931 transitions, 13137 flow [2023-08-24 02:41:00,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=8421, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=435, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=13137, PETRI_PLACES=246, PETRI_TRANSITIONS=931} [2023-08-24 02:41:00,256 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 213 predicate places. [2023-08-24 02:41:00,256 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 931 transitions, 13137 flow [2023-08-24 02:41:00,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 85.1) internal successors, (2553), 30 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:00,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:41:00,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:41:00,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-24 02:41:00,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:41:00,461 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:41:00,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:41:00,461 INFO L85 PathProgramCache]: Analyzing trace with hash 929901233, now seen corresponding path program 5 times [2023-08-24 02:41:00,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:41:00,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958348791] [2023-08-24 02:41:00,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:41:00,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:41:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:41:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:41:01,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:41:01,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958348791] [2023-08-24 02:41:01,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958348791] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:41:01,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535270892] [2023-08-24 02:41:01,370 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 02:41:01,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:41:01,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:41:01,373 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:41:01,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-24 02:41:01,499 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 02:41:01,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:41:01,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 62 conjunts are in the unsatisfiable core [2023-08-24 02:41:01,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:41:01,875 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 02:41:01,892 INFO L322 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-08-24 02:41:01,893 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 31 treesize of output 25 [2023-08-24 02:41:01,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:41:01,904 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:41:02,009 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:41:02,009 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 33 treesize of output 78 [2023-08-24 02:41:02,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:41:02,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535270892] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:41:02,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:41:02,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2023-08-24 02:41:02,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041641414] [2023-08-24 02:41:02,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:41:02,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-24 02:41:02,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:41:02,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-24 02:41:02,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2023-08-24 02:41:02,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 362 [2023-08-24 02:41:02,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 931 transitions, 13137 flow. Second operand has 30 states, 30 states have (on average 98.13333333333334) internal successors, (2944), 30 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:02,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:41:02,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 362 [2023-08-24 02:41:02,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:41:08,072 INFO L124 PetriNetUnfolderBase]: 9870/14327 cut-off events. [2023-08-24 02:41:08,072 INFO L125 PetriNetUnfolderBase]: For 138534/138534 co-relation queries the response was YES. [2023-08-24 02:41:08,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101003 conditions, 14327 events. 9870/14327 cut-off events. For 138534/138534 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 80994 event pairs, 1146 based on Foata normal form. 46/14373 useless extension candidates. Maximal degree in co-relation 100419. Up to 7562 conditions per place. [2023-08-24 02:41:08,231 INFO L140 encePairwiseOnDemand]: 346/362 looper letters, 812 selfloop transitions, 865 changer transitions 3/1680 dead transitions. [2023-08-24 02:41:08,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 1680 transitions, 25811 flow [2023-08-24 02:41:08,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-08-24 02:41:08,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2023-08-24 02:41:08,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 5569 transitions. [2023-08-24 02:41:08,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2902637339726884 [2023-08-24 02:41:08,239 INFO L72 ComplementDD]: Start complementDD. Operand 53 states and 5569 transitions. [2023-08-24 02:41:08,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 5569 transitions. [2023-08-24 02:41:08,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:41:08,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 5569 transitions. [2023-08-24 02:41:08,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 54 states, 53 states have (on average 105.0754716981132) internal successors, (5569), 53 states have internal predecessors, (5569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:08,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 54 states, 54 states have (on average 362.0) internal successors, (19548), 54 states have internal predecessors, (19548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:08,263 INFO L81 ComplementDD]: Finished complementDD. Result has 54 states, 54 states have (on average 362.0) internal successors, (19548), 54 states have internal predecessors, (19548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:08,263 INFO L175 Difference]: Start difference. First operand has 246 places, 931 transitions, 13137 flow. Second operand 53 states and 5569 transitions. [2023-08-24 02:41:08,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 1680 transitions, 25811 flow [2023-08-24 02:41:09,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 1680 transitions, 25355 flow, removed 189 selfloop flow, removed 9 redundant places. [2023-08-24 02:41:09,372 INFO L231 Difference]: Finished difference. Result has 293 places, 1335 transitions, 21348 flow [2023-08-24 02:41:09,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=11212, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=810, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=412, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=21348, PETRI_PLACES=293, PETRI_TRANSITIONS=1335} [2023-08-24 02:41:09,373 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 260 predicate places. [2023-08-24 02:41:09,374 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 1335 transitions, 21348 flow [2023-08-24 02:41:09,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 98.13333333333334) internal successors, (2944), 30 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:09,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:41:09,374 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:41:09,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-24 02:41:09,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-08-24 02:41:09,580 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:41:09,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:41:09,581 INFO L85 PathProgramCache]: Analyzing trace with hash 717577615, now seen corresponding path program 6 times [2023-08-24 02:41:09,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:41:09,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422679800] [2023-08-24 02:41:09,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:41:09,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:41:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:41:09,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:41:09,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:41:09,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422679800] [2023-08-24 02:41:09,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422679800] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:41:09,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603157626] [2023-08-24 02:41:09,694 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 02:41:09,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:41:09,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:41:09,695 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:41:09,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-24 02:41:09,830 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-24 02:41:09,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:41:09,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 02:41:09,833 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:41:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:41:09,891 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:41:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:41:09,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603157626] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:41:09,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:41:09,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-08-24 02:41:09,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653817953] [2023-08-24 02:41:09,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:41:09,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 02:41:09,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:41:09,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 02:41:09,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-08-24 02:41:09,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 362 [2023-08-24 02:41:09,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 1335 transitions, 21348 flow. Second operand has 15 states, 15 states have (on average 136.33333333333334) internal successors, (2045), 15 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:09,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:41:09,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 362 [2023-08-24 02:41:09,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:41:15,235 INFO L124 PetriNetUnfolderBase]: 13840/20443 cut-off events. [2023-08-24 02:41:15,235 INFO L125 PetriNetUnfolderBase]: For 239728/240506 co-relation queries the response was YES. [2023-08-24 02:41:15,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157170 conditions, 20443 events. 13840/20443 cut-off events. For 239728/240506 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 129559 event pairs, 4342 based on Foata normal form. 260/20388 useless extension candidates. Maximal degree in co-relation 156928. Up to 10280 conditions per place. [2023-08-24 02:41:15,576 INFO L140 encePairwiseOnDemand]: 357/362 looper letters, 1731 selfloop transitions, 14 changer transitions 0/1805 dead transitions. [2023-08-24 02:41:15,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 1805 transitions, 32518 flow [2023-08-24 02:41:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 02:41:15,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 02:41:15,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1126 transitions. [2023-08-24 02:41:15,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888121546961326 [2023-08-24 02:41:15,579 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1126 transitions. [2023-08-24 02:41:15,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1126 transitions. [2023-08-24 02:41:15,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:41:15,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1126 transitions. [2023-08-24 02:41:15,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 140.75) internal successors, (1126), 8 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:15,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 362.0) internal successors, (3258), 9 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:15,584 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 362.0) internal successors, (3258), 9 states have internal predecessors, (3258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:15,584 INFO L175 Difference]: Start difference. First operand has 293 places, 1335 transitions, 21348 flow. Second operand 8 states and 1126 transitions. [2023-08-24 02:41:15,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 1805 transitions, 32518 flow [2023-08-24 02:41:17,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 1805 transitions, 31415 flow, removed 316 selfloop flow, removed 26 redundant places. [2023-08-24 02:41:18,008 INFO L231 Difference]: Finished difference. Result has 257 places, 989 transitions, 15146 flow [2023-08-24 02:41:18,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=15118, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=989, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=975, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15146, PETRI_PLACES=257, PETRI_TRANSITIONS=989} [2023-08-24 02:41:18,009 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 224 predicate places. [2023-08-24 02:41:18,009 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 989 transitions, 15146 flow [2023-08-24 02:41:18,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 136.33333333333334) internal successors, (2045), 15 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:18,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:41:18,010 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:41:18,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-24 02:41:18,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-24 02:41:18,216 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:41:18,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:41:18,217 INFO L85 PathProgramCache]: Analyzing trace with hash 455895023, now seen corresponding path program 7 times [2023-08-24 02:41:18,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:41:18,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608037216] [2023-08-24 02:41:18,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:41:18,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:41:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:41:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:41:18,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:41:18,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608037216] [2023-08-24 02:41:18,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608037216] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:41:18,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744699838] [2023-08-24 02:41:18,335 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 02:41:18,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:41:18,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:41:18,337 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:41:18,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-24 02:41:18,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:41:18,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 02:41:18,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:41:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:41:18,539 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:41:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:41:18,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744699838] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:41:18,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:41:18,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-08-24 02:41:18,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33497844] [2023-08-24 02:41:18,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:41:18,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-24 02:41:18,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:41:18,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-24 02:41:18,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-08-24 02:41:18,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 362 [2023-08-24 02:41:18,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 989 transitions, 15146 flow. Second operand has 14 states, 14 states have (on average 132.64285714285714) internal successors, (1857), 14 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:18,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:41:18,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 362 [2023-08-24 02:41:18,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:41:23,090 INFO L124 PetriNetUnfolderBase]: 13125/19998 cut-off events. [2023-08-24 02:41:23,091 INFO L125 PetriNetUnfolderBase]: For 257170/257678 co-relation queries the response was YES. [2023-08-24 02:41:23,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148581 conditions, 19998 events. 13125/19998 cut-off events. For 257170/257678 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 136283 event pairs, 1984 based on Foata normal form. 1550/21380 useless extension candidates. Maximal degree in co-relation 147158. Up to 11170 conditions per place. [2023-08-24 02:41:23,340 INFO L140 encePairwiseOnDemand]: 354/362 looper letters, 1066 selfloop transitions, 161 changer transitions 1/1256 dead transitions. [2023-08-24 02:41:23,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 1256 transitions, 21962 flow [2023-08-24 02:41:23,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 02:41:23,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 02:41:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1248 transitions. [2023-08-24 02:41:23,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3830570902394107 [2023-08-24 02:41:23,343 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1248 transitions. [2023-08-24 02:41:23,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1248 transitions. [2023-08-24 02:41:23,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:41:23,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1248 transitions. [2023-08-24 02:41:23,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 138.66666666666666) internal successors, (1248), 9 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:23,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 362.0) internal successors, (3620), 10 states have internal predecessors, (3620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:23,348 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 362.0) internal successors, (3620), 10 states have internal predecessors, (3620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:23,348 INFO L175 Difference]: Start difference. First operand has 257 places, 989 transitions, 15146 flow. Second operand 9 states and 1248 transitions. [2023-08-24 02:41:23,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 1256 transitions, 21962 flow [2023-08-24 02:41:25,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 1256 transitions, 21938 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-24 02:41:25,037 INFO L231 Difference]: Finished difference. Result has 262 places, 889 transitions, 14247 flow [2023-08-24 02:41:25,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=13405, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=876, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=715, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14247, PETRI_PLACES=262, PETRI_TRANSITIONS=889} [2023-08-24 02:41:25,038 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 229 predicate places. [2023-08-24 02:41:25,038 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 889 transitions, 14247 flow [2023-08-24 02:41:25,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 132.64285714285714) internal successors, (1857), 14 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:25,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:41:25,039 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:41:25,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-24 02:41:25,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-24 02:41:25,240 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:41:25,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:41:25,240 INFO L85 PathProgramCache]: Analyzing trace with hash -226947251, now seen corresponding path program 8 times [2023-08-24 02:41:25,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:41:25,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959685891] [2023-08-24 02:41:25,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:41:25,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:41:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:41:25,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 02:41:25,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:41:25,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959685891] [2023-08-24 02:41:25,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959685891] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:41:25,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165763460] [2023-08-24 02:41:25,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 02:41:25,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:41:25,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:41:25,373 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:41:25,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-24 02:41:25,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 02:41:25,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:41:25,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 02:41:25,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:41:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 02:41:25,619 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:41:25,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 02:41:25,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165763460] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:41:25,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:41:25,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2023-08-24 02:41:25,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925143141] [2023-08-24 02:41:25,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:41:25,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-24 02:41:25,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:41:25,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-24 02:41:25,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2023-08-24 02:41:25,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 362 [2023-08-24 02:41:25,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 889 transitions, 14247 flow. Second operand has 20 states, 20 states have (on average 120.9) internal successors, (2418), 20 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:25,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:41:25,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 362 [2023-08-24 02:41:25,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:41:30,308 INFO L124 PetriNetUnfolderBase]: 11289/16987 cut-off events. [2023-08-24 02:41:30,308 INFO L125 PetriNetUnfolderBase]: For 202367/202367 co-relation queries the response was YES. [2023-08-24 02:41:30,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133074 conditions, 16987 events. 11289/16987 cut-off events. For 202367/202367 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 107905 event pairs, 1253 based on Foata normal form. 972/17959 useless extension candidates. Maximal degree in co-relation 132316. Up to 5901 conditions per place. [2023-08-24 02:41:30,640 INFO L140 encePairwiseOnDemand]: 345/362 looper letters, 558 selfloop transitions, 946 changer transitions 739/2243 dead transitions. [2023-08-24 02:41:30,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 2243 transitions, 39796 flow [2023-08-24 02:41:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-08-24 02:41:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-08-24 02:41:30,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 5795 transitions. [2023-08-24 02:41:30,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34800624549603654 [2023-08-24 02:41:30,647 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 5795 transitions. [2023-08-24 02:41:30,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 5795 transitions. [2023-08-24 02:41:30,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:41:30,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 5795 transitions. [2023-08-24 02:41:30,656 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 125.97826086956522) internal successors, (5795), 46 states have internal predecessors, (5795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:30,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 362.0) internal successors, (17014), 47 states have internal predecessors, (17014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:30,668 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 362.0) internal successors, (17014), 47 states have internal predecessors, (17014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:30,668 INFO L175 Difference]: Start difference. First operand has 262 places, 889 transitions, 14247 flow. Second operand 46 states and 5795 transitions. [2023-08-24 02:41:30,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 2243 transitions, 39796 flow [2023-08-24 02:41:32,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 2243 transitions, 39748 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-08-24 02:41:32,441 INFO L231 Difference]: Finished difference. Result has 337 places, 1277 transitions, 24515 flow [2023-08-24 02:41:32,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=14217, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=889, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=588, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=24515, PETRI_PLACES=337, PETRI_TRANSITIONS=1277} [2023-08-24 02:41:32,442 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 304 predicate places. [2023-08-24 02:41:32,442 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 1277 transitions, 24515 flow [2023-08-24 02:41:32,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 120.9) internal successors, (2418), 20 states have internal predecessors, (2418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:32,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:41:32,443 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:41:32,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-24 02:41:32,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-24 02:41:32,643 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:41:32,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:41:32,644 INFO L85 PathProgramCache]: Analyzing trace with hash -988261552, now seen corresponding path program 9 times [2023-08-24 02:41:32,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:41:32,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063736417] [2023-08-24 02:41:32,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:41:32,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:41:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:41:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:41:32,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:41:32,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063736417] [2023-08-24 02:41:32,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063736417] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:41:32,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630881962] [2023-08-24 02:41:32,808 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 02:41:32,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:41:32,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:41:32,809 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:41:32,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-24 02:41:32,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-24 02:41:32,954 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:41:32,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-24 02:41:32,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:41:33,091 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:41:33,092 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:41:33,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:41:33,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630881962] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:41:33,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:41:33,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-08-24 02:41:33,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053631599] [2023-08-24 02:41:33,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:41:33,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-24 02:41:33,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:41:33,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-24 02:41:33,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2023-08-24 02:41:33,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 362 [2023-08-24 02:41:33,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 1277 transitions, 24515 flow. Second operand has 17 states, 17 states have (on average 129.52941176470588) internal successors, (2202), 17 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:33,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:41:33,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 362 [2023-08-24 02:41:33,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:41:35,450 INFO L124 PetriNetUnfolderBase]: 4859/7542 cut-off events. [2023-08-24 02:41:35,450 INFO L125 PetriNetUnfolderBase]: For 199097/199291 co-relation queries the response was YES. [2023-08-24 02:41:35,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71125 conditions, 7542 events. 4859/7542 cut-off events. For 199097/199291 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 45236 event pairs, 1064 based on Foata normal form. 500/7973 useless extension candidates. Maximal degree in co-relation 71016. Up to 3178 conditions per place. [2023-08-24 02:41:35,535 INFO L140 encePairwiseOnDemand]: 353/362 looper letters, 746 selfloop transitions, 90 changer transitions 47/952 dead transitions. [2023-08-24 02:41:35,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 952 transitions, 19311 flow [2023-08-24 02:41:35,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 02:41:35,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 02:41:35,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1209 transitions. [2023-08-24 02:41:35,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3710865561694291 [2023-08-24 02:41:35,537 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1209 transitions. [2023-08-24 02:41:35,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1209 transitions. [2023-08-24 02:41:35,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:41:35,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1209 transitions. [2023-08-24 02:41:35,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 134.33333333333334) internal successors, (1209), 9 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:35,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 362.0) internal successors, (3620), 10 states have internal predecessors, (3620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:35,541 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 362.0) internal successors, (3620), 10 states have internal predecessors, (3620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:35,541 INFO L175 Difference]: Start difference. First operand has 337 places, 1277 transitions, 24515 flow. Second operand 9 states and 1209 transitions. [2023-08-24 02:41:35,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 952 transitions, 19311 flow [2023-08-24 02:41:36,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 952 transitions, 17121 flow, removed 639 selfloop flow, removed 24 redundant places. [2023-08-24 02:41:36,618 INFO L231 Difference]: Finished difference. Result has 295 places, 840 transitions, 14143 flow [2023-08-24 02:41:36,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=14496, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=885, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=795, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=14143, PETRI_PLACES=295, PETRI_TRANSITIONS=840} [2023-08-24 02:41:36,620 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 262 predicate places. [2023-08-24 02:41:36,620 INFO L495 AbstractCegarLoop]: Abstraction has has 295 places, 840 transitions, 14143 flow [2023-08-24 02:41:36,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 129.52941176470588) internal successors, (2202), 17 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:36,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:41:36,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:41:36,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-24 02:41:36,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-24 02:41:36,829 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:41:36,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:41:36,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1389074324, now seen corresponding path program 1 times [2023-08-24 02:41:36,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:41:36,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398868589] [2023-08-24 02:41:36,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:41:36,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:41:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:41:36,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:41:36,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:41:36,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398868589] [2023-08-24 02:41:36,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398868589] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:41:36,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094211479] [2023-08-24 02:41:36,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:41:36,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:41:36,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:41:36,949 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:41:36,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-24 02:41:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:41:37,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-24 02:41:37,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:41:37,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:41:37,135 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:41:37,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:41:37,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094211479] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:41:37,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:41:37,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2023-08-24 02:41:37,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123485069] [2023-08-24 02:41:37,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:41:37,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-24 02:41:37,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:41:37,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-24 02:41:37,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2023-08-24 02:41:37,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 362 [2023-08-24 02:41:37,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 840 transitions, 14143 flow. Second operand has 16 states, 16 states have (on average 124.8125) internal successors, (1997), 16 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:37,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:41:37,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 362 [2023-08-24 02:41:37,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:41:38,402 INFO L124 PetriNetUnfolderBase]: 3035/4660 cut-off events. [2023-08-24 02:41:38,402 INFO L125 PetriNetUnfolderBase]: For 112640/112663 co-relation queries the response was YES. [2023-08-24 02:41:38,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42087 conditions, 4660 events. 3035/4660 cut-off events. For 112640/112663 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 24522 event pairs, 844 based on Foata normal form. 181/4839 useless extension candidates. Maximal degree in co-relation 41995. Up to 3252 conditions per place. [2023-08-24 02:41:38,466 INFO L140 encePairwiseOnDemand]: 352/362 looper letters, 488 selfloop transitions, 6 changer transitions 152/680 dead transitions. [2023-08-24 02:41:38,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 680 transitions, 12244 flow [2023-08-24 02:41:38,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 02:41:38,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 02:41:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1300 transitions. [2023-08-24 02:41:38,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35911602209944754 [2023-08-24 02:41:38,468 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1300 transitions. [2023-08-24 02:41:38,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1300 transitions. [2023-08-24 02:41:38,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:41:38,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1300 transitions. [2023-08-24 02:41:38,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 130.0) internal successors, (1300), 10 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:38,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 362.0) internal successors, (3982), 11 states have internal predecessors, (3982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:38,471 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 362.0) internal successors, (3982), 11 states have internal predecessors, (3982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:38,472 INFO L175 Difference]: Start difference. First operand has 295 places, 840 transitions, 14143 flow. Second operand 10 states and 1300 transitions. [2023-08-24 02:41:38,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 680 transitions, 12244 flow [2023-08-24 02:41:38,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 680 transitions, 11259 flow, removed 196 selfloop flow, removed 22 redundant places. [2023-08-24 02:41:38,986 INFO L231 Difference]: Finished difference. Result has 259 places, 528 transitions, 8124 flow [2023-08-24 02:41:38,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=9486, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8124, PETRI_PLACES=259, PETRI_TRANSITIONS=528} [2023-08-24 02:41:38,987 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 226 predicate places. [2023-08-24 02:41:38,987 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 528 transitions, 8124 flow [2023-08-24 02:41:38,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 124.8125) internal successors, (1997), 16 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:38,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:41:38,988 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:41:38,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-24 02:41:39,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-24 02:41:39,194 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:41:39,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:41:39,194 INFO L85 PathProgramCache]: Analyzing trace with hash 469753245, now seen corresponding path program 10 times [2023-08-24 02:41:39,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:41:39,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683008451] [2023-08-24 02:41:39,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:41:39,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:41:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:41:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:41:39,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:41:39,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683008451] [2023-08-24 02:41:39,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683008451] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:41:39,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615689005] [2023-08-24 02:41:39,346 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 02:41:39,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:41:39,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:41:39,347 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:41:39,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-24 02:41:39,480 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 02:41:39,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:41:39,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 02:41:39,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:41:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:41:39,571 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:41:39,649 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:41:39,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615689005] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:41:39,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:41:39,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2023-08-24 02:41:39,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31905838] [2023-08-24 02:41:39,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:41:39,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-24 02:41:39,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:41:39,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-24 02:41:39,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-08-24 02:41:39,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 362 [2023-08-24 02:41:39,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 528 transitions, 8124 flow. Second operand has 20 states, 20 states have (on average 124.35) internal successors, (2487), 20 states have internal predecessors, (2487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:39,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:41:39,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 362 [2023-08-24 02:41:39,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:41:40,990 INFO L124 PetriNetUnfolderBase]: 3478/5050 cut-off events. [2023-08-24 02:41:40,991 INFO L125 PetriNetUnfolderBase]: For 106282/106293 co-relation queries the response was YES. [2023-08-24 02:41:41,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46205 conditions, 5050 events. 3478/5050 cut-off events. For 106282/106293 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 24412 event pairs, 256 based on Foata normal form. 25/5075 useless extension candidates. Maximal degree in co-relation 46122. Up to 2409 conditions per place. [2023-08-24 02:41:41,042 INFO L140 encePairwiseOnDemand]: 348/362 looper letters, 358 selfloop transitions, 500 changer transitions 0/892 dead transitions. [2023-08-24 02:41:41,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 892 transitions, 16088 flow [2023-08-24 02:41:41,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-24 02:41:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-24 02:41:41,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2461 transitions. [2023-08-24 02:41:41,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35780750218086654 [2023-08-24 02:41:41,045 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2461 transitions. [2023-08-24 02:41:41,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2461 transitions. [2023-08-24 02:41:41,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:41:41,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2461 transitions. [2023-08-24 02:41:41,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 129.52631578947367) internal successors, (2461), 19 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:41,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 362.0) internal successors, (7240), 20 states have internal predecessors, (7240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:41,053 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 362.0) internal successors, (7240), 20 states have internal predecessors, (7240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:41,053 INFO L175 Difference]: Start difference. First operand has 259 places, 528 transitions, 8124 flow. Second operand 19 states and 2461 transitions. [2023-08-24 02:41:41,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 892 transitions, 16088 flow [2023-08-24 02:41:41,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 892 transitions, 14880 flow, removed 257 selfloop flow, removed 23 redundant places. [2023-08-24 02:41:41,442 INFO L231 Difference]: Finished difference. Result has 201 places, 734 transitions, 12559 flow [2023-08-24 02:41:41,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=7432, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=303, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=12559, PETRI_PLACES=201, PETRI_TRANSITIONS=734} [2023-08-24 02:41:41,443 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 168 predicate places. [2023-08-24 02:41:41,443 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 734 transitions, 12559 flow [2023-08-24 02:41:41,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 124.35) internal successors, (2487), 20 states have internal predecessors, (2487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:41,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:41:41,444 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:41:41,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-08-24 02:41:41,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:41:41,650 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:41:41,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:41:41,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1452152421, now seen corresponding path program 11 times [2023-08-24 02:41:41,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:41:41,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78470251] [2023-08-24 02:41:41,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:41:41,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:41:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:41:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:41:41,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:41:41,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78470251] [2023-08-24 02:41:41,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78470251] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:41:41,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463009716] [2023-08-24 02:41:41,797 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 02:41:41,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:41:41,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:41:41,798 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:41:41,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-24 02:41:41,928 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 02:41:41,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:41:41,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 02:41:41,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:41:42,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:41:42,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:41:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:41:42,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463009716] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:41:42,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:41:42,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2023-08-24 02:41:42,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627732551] [2023-08-24 02:41:42,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:41:42,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-24 02:41:42,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:41:42,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-24 02:41:42,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-08-24 02:41:42,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 362 [2023-08-24 02:41:42,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 734 transitions, 12559 flow. Second operand has 17 states, 17 states have (on average 120.82352941176471) internal successors, (2054), 17 states have internal predecessors, (2054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:42,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:41:42,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 362 [2023-08-24 02:41:42,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:41:43,919 INFO L124 PetriNetUnfolderBase]: 3680/5375 cut-off events. [2023-08-24 02:41:43,919 INFO L125 PetriNetUnfolderBase]: For 108343/108343 co-relation queries the response was YES. [2023-08-24 02:41:43,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49180 conditions, 5375 events. 3680/5375 cut-off events. For 108343/108343 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 26351 event pairs, 211 based on Foata normal form. 30/5405 useless extension candidates. Maximal degree in co-relation 49107. Up to 2519 conditions per place. [2023-08-24 02:41:43,984 INFO L140 encePairwiseOnDemand]: 347/362 looper letters, 403 selfloop transitions, 693 changer transitions 0/1096 dead transitions. [2023-08-24 02:41:43,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 1096 transitions, 20419 flow [2023-08-24 02:41:43,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-24 02:41:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-24 02:41:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3754 transitions. [2023-08-24 02:41:43,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3456721915285451 [2023-08-24 02:41:43,988 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3754 transitions. [2023-08-24 02:41:43,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3754 transitions. [2023-08-24 02:41:43,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:41:43,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3754 transitions. [2023-08-24 02:41:43,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 125.13333333333334) internal successors, (3754), 30 states have internal predecessors, (3754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:44,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 362.0) internal successors, (11222), 31 states have internal predecessors, (11222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:44,002 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 362.0) internal successors, (11222), 31 states have internal predecessors, (11222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:44,002 INFO L175 Difference]: Start difference. First operand has 201 places, 734 transitions, 12559 flow. Second operand 30 states and 3754 transitions. [2023-08-24 02:41:44,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 1096 transitions, 20419 flow [2023-08-24 02:41:44,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 1096 transitions, 19423 flow, removed 236 selfloop flow, removed 11 redundant places. [2023-08-24 02:41:44,674 INFO L231 Difference]: Finished difference. Result has 226 places, 915 transitions, 16862 flow [2023-08-24 02:41:44,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=11868, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=513, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=16862, PETRI_PLACES=226, PETRI_TRANSITIONS=915} [2023-08-24 02:41:44,676 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 193 predicate places. [2023-08-24 02:41:44,677 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 915 transitions, 16862 flow [2023-08-24 02:41:44,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 120.82352941176471) internal successors, (2054), 17 states have internal predecessors, (2054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:44,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:41:44,677 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:41:44,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-24 02:41:44,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-24 02:41:44,884 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:41:44,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:41:44,884 INFO L85 PathProgramCache]: Analyzing trace with hash -369483559, now seen corresponding path program 12 times [2023-08-24 02:41:44,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:41:44,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398777185] [2023-08-24 02:41:44,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:41:44,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:41:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:41:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:41:45,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:41:45,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398777185] [2023-08-24 02:41:45,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398777185] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:41:45,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933218494] [2023-08-24 02:41:45,040 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 02:41:45,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:41:45,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:41:45,041 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:41:45,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-24 02:41:45,185 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-24 02:41:45,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:41:45,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 02:41:45,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:41:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:41:45,262 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:41:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:41:45,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933218494] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:41:45,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:41:45,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2023-08-24 02:41:45,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753048570] [2023-08-24 02:41:45,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:41:45,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-24 02:41:45,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:41:45,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-24 02:41:45,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-08-24 02:41:45,356 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 362 [2023-08-24 02:41:45,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 915 transitions, 16862 flow. Second operand has 20 states, 20 states have (on average 124.25) internal successors, (2485), 20 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:45,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:41:45,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 362 [2023-08-24 02:41:45,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:41:47,285 INFO L124 PetriNetUnfolderBase]: 4956/7245 cut-off events. [2023-08-24 02:41:47,285 INFO L125 PetriNetUnfolderBase]: For 151620/151623 co-relation queries the response was YES. [2023-08-24 02:41:47,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68583 conditions, 7245 events. 4956/7245 cut-off events. For 151620/151623 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 36941 event pairs, 234 based on Foata normal form. 12/7254 useless extension candidates. Maximal degree in co-relation 68508. Up to 3523 conditions per place. [2023-08-24 02:41:47,377 INFO L140 encePairwiseOnDemand]: 349/362 looper letters, 571 selfloop transitions, 799 changer transitions 0/1418 dead transitions. [2023-08-24 02:41:47,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 1418 transitions, 29299 flow [2023-08-24 02:41:47,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-24 02:41:47,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-24 02:41:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2199 transitions. [2023-08-24 02:41:47,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35732856678583036 [2023-08-24 02:41:47,379 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2199 transitions. [2023-08-24 02:41:47,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2199 transitions. [2023-08-24 02:41:47,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:41:47,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2199 transitions. [2023-08-24 02:41:47,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 129.35294117647058) internal successors, (2199), 17 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:47,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 362.0) internal successors, (6516), 18 states have internal predecessors, (6516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:47,386 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 362.0) internal successors, (6516), 18 states have internal predecessors, (6516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:47,386 INFO L175 Difference]: Start difference. First operand has 226 places, 915 transitions, 16862 flow. Second operand 17 states and 2199 transitions. [2023-08-24 02:41:47,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 1418 transitions, 29299 flow [2023-08-24 02:41:48,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 1418 transitions, 28857 flow, removed 156 selfloop flow, removed 11 redundant places. [2023-08-24 02:41:48,482 INFO L231 Difference]: Finished difference. Result has 237 places, 1198 transitions, 24909 flow [2023-08-24 02:41:48,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=16552, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=915, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=519, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=24909, PETRI_PLACES=237, PETRI_TRANSITIONS=1198} [2023-08-24 02:41:48,483 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 204 predicate places. [2023-08-24 02:41:48,483 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 1198 transitions, 24909 flow [2023-08-24 02:41:48,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 124.25) internal successors, (2485), 20 states have internal predecessors, (2485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:48,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:41:48,484 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:41:48,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-24 02:41:48,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-24 02:41:48,690 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:41:48,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:41:48,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1702220595, now seen corresponding path program 13 times [2023-08-24 02:41:48,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:41:48,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802504748] [2023-08-24 02:41:48,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:41:48,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:41:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:41:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:41:48,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:41:48,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802504748] [2023-08-24 02:41:48,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802504748] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:41:48,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764368821] [2023-08-24 02:41:48,849 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 02:41:48,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:41:48,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:41:48,853 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:41:48,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-24 02:41:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:41:49,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 02:41:49,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:41:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:41:49,135 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:41:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:41:49,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764368821] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:41:49,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:41:49,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-08-24 02:41:49,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700801954] [2023-08-24 02:41:49,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:41:49,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-24 02:41:49,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:41:49,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-24 02:41:49,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2023-08-24 02:41:49,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 362 [2023-08-24 02:41:49,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 1198 transitions, 24909 flow. Second operand has 21 states, 21 states have (on average 124.19047619047619) internal successors, (2608), 21 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:49,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:41:49,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 362 [2023-08-24 02:41:49,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:41:53,404 INFO L124 PetriNetUnfolderBase]: 7026/10163 cut-off events. [2023-08-24 02:41:53,405 INFO L125 PetriNetUnfolderBase]: For 244362/244365 co-relation queries the response was YES. [2023-08-24 02:41:53,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102914 conditions, 10163 events. 7026/10163 cut-off events. For 244362/244365 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 53866 event pairs, 252 based on Foata normal form. 14/10174 useless extension candidates. Maximal degree in co-relation 102839. Up to 5023 conditions per place. [2023-08-24 02:41:53,546 INFO L140 encePairwiseOnDemand]: 348/362 looper letters, 939 selfloop transitions, 1041 changer transitions 0/2028 dead transitions. [2023-08-24 02:41:53,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 2028 transitions, 45104 flow [2023-08-24 02:41:53,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-24 02:41:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-24 02:41:53,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 4970 transitions. [2023-08-24 02:41:53,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3612968886304158 [2023-08-24 02:41:53,552 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 4970 transitions. [2023-08-24 02:41:53,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 4970 transitions. [2023-08-24 02:41:53,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:41:53,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 4970 transitions. [2023-08-24 02:41:53,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 130.78947368421052) internal successors, (4970), 38 states have internal predecessors, (4970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:53,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 362.0) internal successors, (14118), 39 states have internal predecessors, (14118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:53,570 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 362.0) internal successors, (14118), 39 states have internal predecessors, (14118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:53,570 INFO L175 Difference]: Start difference. First operand has 237 places, 1198 transitions, 24909 flow. Second operand 38 states and 4970 transitions. [2023-08-24 02:41:53,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 2028 transitions, 45104 flow [2023-08-24 02:41:55,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 2028 transitions, 43568 flow, removed 121 selfloop flow, removed 7 redundant places. [2023-08-24 02:41:55,539 INFO L231 Difference]: Finished difference. Result has 278 places, 1550 transitions, 34903 flow [2023-08-24 02:41:55,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=23867, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=699, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=34903, PETRI_PLACES=278, PETRI_TRANSITIONS=1550} [2023-08-24 02:41:55,541 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 245 predicate places. [2023-08-24 02:41:55,541 INFO L495 AbstractCegarLoop]: Abstraction has has 278 places, 1550 transitions, 34903 flow [2023-08-24 02:41:55,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 124.19047619047619) internal successors, (2608), 21 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:55,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:41:55,542 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:41:55,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-24 02:41:55,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-24 02:41:55,745 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:41:55,745 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:41:55,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1620112755, now seen corresponding path program 14 times [2023-08-24 02:41:55,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:41:55,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568607071] [2023-08-24 02:41:55,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:41:55,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:41:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:41:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:41:55,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:41:55,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568607071] [2023-08-24 02:41:55,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568607071] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:41:55,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434625573] [2023-08-24 02:41:55,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 02:41:55,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:41:55,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:41:55,903 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:41:55,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-24 02:41:56,052 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 02:41:56,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:41:56,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 02:41:56,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:41:56,162 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:41:56,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:41:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:41:56,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434625573] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:41:56,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:41:56,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-08-24 02:41:56,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049171684] [2023-08-24 02:41:56,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:41:56,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-24 02:41:56,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:41:56,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-24 02:41:56,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2023-08-24 02:41:56,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 362 [2023-08-24 02:41:56,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 1550 transitions, 34903 flow. Second operand has 22 states, 22 states have (on average 124.04545454545455) internal successors, (2729), 22 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:41:56,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:41:56,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 362 [2023-08-24 02:41:56,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:42:01,844 INFO L124 PetriNetUnfolderBase]: 10632/15201 cut-off events. [2023-08-24 02:42:01,844 INFO L125 PetriNetUnfolderBase]: For 375601/375628 co-relation queries the response was YES. [2023-08-24 02:42:02,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160506 conditions, 15201 events. 10632/15201 cut-off events. For 375601/375628 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 82896 event pairs, 250 based on Foata normal form. 36/15234 useless extension candidates. Maximal degree in co-relation 160421. Up to 7571 conditions per place. [2023-08-24 02:42:02,243 INFO L140 encePairwiseOnDemand]: 349/362 looper letters, 1004 selfloop transitions, 1675 changer transitions 0/2727 dead transitions. [2023-08-24 02:42:02,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 2727 transitions, 64030 flow [2023-08-24 02:42:02,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-08-24 02:42:02,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-08-24 02:42:02,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 5632 transitions. [2023-08-24 02:42:02,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.361814210458692 [2023-08-24 02:42:02,248 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 5632 transitions. [2023-08-24 02:42:02,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 5632 transitions. [2023-08-24 02:42:02,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:42:02,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 5632 transitions. [2023-08-24 02:42:02,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 130.97674418604652) internal successors, (5632), 43 states have internal predecessors, (5632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:42:02,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 362.0) internal successors, (15928), 44 states have internal predecessors, (15928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:42:02,266 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 362.0) internal successors, (15928), 44 states have internal predecessors, (15928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:42:02,266 INFO L175 Difference]: Start difference. First operand has 278 places, 1550 transitions, 34903 flow. Second operand 43 states and 5632 transitions. [2023-08-24 02:42:02,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 2727 transitions, 64030 flow [2023-08-24 02:42:05,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 2727 transitions, 59417 flow, removed 474 selfloop flow, removed 13 redundant places. [2023-08-24 02:42:05,723 INFO L231 Difference]: Finished difference. Result has 311 places, 2084 transitions, 47757 flow [2023-08-24 02:42:05,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=31872, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=47757, PETRI_PLACES=311, PETRI_TRANSITIONS=2084} [2023-08-24 02:42:05,724 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 278 predicate places. [2023-08-24 02:42:05,724 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 2084 transitions, 47757 flow [2023-08-24 02:42:05,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 124.04545454545455) internal successors, (2729), 22 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:42:05,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:42:05,725 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:42:05,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-24 02:42:05,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:42:05,926 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:42:05,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:42:05,926 INFO L85 PathProgramCache]: Analyzing trace with hash 515814499, now seen corresponding path program 15 times [2023-08-24 02:42:05,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:42:05,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809845893] [2023-08-24 02:42:05,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:42:05,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:42:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:42:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:42:06,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:42:06,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809845893] [2023-08-24 02:42:06,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809845893] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:42:06,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097832760] [2023-08-24 02:42:06,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 02:42:06,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:42:06,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:42:06,081 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:42:06,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-24 02:42:06,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 02:42:06,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:42:06,226 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 02:42:06,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:42:06,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:42:06,326 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:42:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:42:06,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097832760] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:42:06,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:42:06,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-08-24 02:42:06,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987493905] [2023-08-24 02:42:06,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:42:06,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-24 02:42:06,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:42:06,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-24 02:42:06,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-08-24 02:42:06,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 362 [2023-08-24 02:42:06,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 2084 transitions, 47757 flow. Second operand has 21 states, 21 states have (on average 124.38095238095238) internal successors, (2612), 21 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:42:06,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:42:06,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 362 [2023-08-24 02:42:06,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:42:12,274 INFO L124 PetriNetUnfolderBase]: 11023/15757 cut-off events. [2023-08-24 02:42:12,275 INFO L125 PetriNetUnfolderBase]: For 371022/371052 co-relation queries the response was YES. [2023-08-24 02:42:12,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160822 conditions, 15757 events. 11023/15757 cut-off events. For 371022/371052 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 86543 event pairs, 611 based on Foata normal form. 36/15792 useless extension candidates. Maximal degree in co-relation 160735. Up to 7874 conditions per place. [2023-08-24 02:42:12,592 INFO L140 encePairwiseOnDemand]: 348/362 looper letters, 539 selfloop transitions, 1840 changer transitions 0/2427 dead transitions. [2023-08-24 02:42:12,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 2427 transitions, 58548 flow [2023-08-24 02:42:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-24 02:42:12,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-24 02:42:12,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3642 transitions. [2023-08-24 02:42:12,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35931333859510656 [2023-08-24 02:42:12,595 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 3642 transitions. [2023-08-24 02:42:12,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 3642 transitions. [2023-08-24 02:42:12,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:42:12,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 3642 transitions. [2023-08-24 02:42:12,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 130.07142857142858) internal successors, (3642), 28 states have internal predecessors, (3642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:42:12,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 362.0) internal successors, (10498), 29 states have internal predecessors, (10498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:42:12,603 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 362.0) internal successors, (10498), 29 states have internal predecessors, (10498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:42:12,603 INFO L175 Difference]: Start difference. First operand has 311 places, 2084 transitions, 47757 flow. Second operand 28 states and 3642 transitions. [2023-08-24 02:42:12,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 2427 transitions, 58548 flow [2023-08-24 02:42:15,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 2427 transitions, 55804 flow, removed 119 selfloop flow, removed 14 redundant places. [2023-08-24 02:42:16,025 INFO L231 Difference]: Finished difference. Result has 329 places, 2177 transitions, 51605 flow [2023-08-24 02:42:16,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=45157, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2084, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1755, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=51605, PETRI_PLACES=329, PETRI_TRANSITIONS=2177} [2023-08-24 02:42:16,027 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 296 predicate places. [2023-08-24 02:42:16,027 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 2177 transitions, 51605 flow [2023-08-24 02:42:16,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 124.38095238095238) internal successors, (2612), 21 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:42:16,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:42:16,028 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:42:16,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-24 02:42:16,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:42:16,233 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:42:16,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:42:16,234 INFO L85 PathProgramCache]: Analyzing trace with hash -855207849, now seen corresponding path program 16 times [2023-08-24 02:42:16,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:42:16,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427548153] [2023-08-24 02:42:16,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:42:16,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:42:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:42:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:42:16,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:42:16,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427548153] [2023-08-24 02:42:16,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427548153] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:42:16,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885790876] [2023-08-24 02:42:16,381 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 02:42:16,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:42:16,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:42:16,385 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:42:16,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-24 02:42:16,514 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 02:42:16,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:42:16,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 02:42:16,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:42:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:42:16,613 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:42:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:42:16,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885790876] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:42:16,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:42:16,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-08-24 02:42:16,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148058706] [2023-08-24 02:42:16,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:42:16,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-24 02:42:16,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:42:16,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-24 02:42:16,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2023-08-24 02:42:16,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 362 [2023-08-24 02:42:16,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 2177 transitions, 51605 flow. Second operand has 22 states, 22 states have (on average 124.04545454545455) internal successors, (2729), 22 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:42:16,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:42:16,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 362 [2023-08-24 02:42:16,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:42:22,898 INFO L124 PetriNetUnfolderBase]: 11556/16516 cut-off events. [2023-08-24 02:42:22,898 INFO L125 PetriNetUnfolderBase]: For 404494/404516 co-relation queries the response was YES. [2023-08-24 02:42:23,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171983 conditions, 16516 events. 11556/16516 cut-off events. For 404494/404516 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 91428 event pairs, 861 based on Foata normal form. 26/16542 useless extension candidates. Maximal degree in co-relation 171896. Up to 8209 conditions per place. [2023-08-24 02:42:23,090 INFO L140 encePairwiseOnDemand]: 349/362 looper letters, 1016 selfloop transitions, 1441 changer transitions 0/2505 dead transitions. [2023-08-24 02:42:23,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 2505 transitions, 62538 flow [2023-08-24 02:42:23,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-24 02:42:23,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-24 02:42:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2595 transitions. [2023-08-24 02:42:23,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35842541436464087 [2023-08-24 02:42:23,092 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2595 transitions. [2023-08-24 02:42:23,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2595 transitions. [2023-08-24 02:42:23,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:42:23,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2595 transitions. [2023-08-24 02:42:23,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 129.75) internal successors, (2595), 20 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:42:23,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 362.0) internal successors, (7602), 21 states have internal predecessors, (7602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:42:23,098 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 362.0) internal successors, (7602), 21 states have internal predecessors, (7602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:42:23,098 INFO L175 Difference]: Start difference. First operand has 329 places, 2177 transitions, 51605 flow. Second operand 20 states and 2595 transitions. [2023-08-24 02:42:23,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 2505 transitions, 62538 flow [2023-08-24 02:42:27,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 2505 transitions, 61165 flow, removed 72 selfloop flow, removed 13 redundant places. [2023-08-24 02:42:27,547 INFO L231 Difference]: Finished difference. Result has 337 places, 2280 transitions, 56349 flow [2023-08-24 02:42:27,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=50262, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1335, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=777, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=56349, PETRI_PLACES=337, PETRI_TRANSITIONS=2280} [2023-08-24 02:42:27,548 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 304 predicate places. [2023-08-24 02:42:27,548 INFO L495 AbstractCegarLoop]: Abstraction has has 337 places, 2280 transitions, 56349 flow [2023-08-24 02:42:27,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 124.04545454545455) internal successors, (2729), 22 states have internal predecessors, (2729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:42:27,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:42:27,549 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:42:27,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-24 02:42:27,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-08-24 02:42:27,750 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:42:27,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:42:27,750 INFO L85 PathProgramCache]: Analyzing trace with hash 795410662, now seen corresponding path program 2 times [2023-08-24 02:42:27,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:42:27,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757455562] [2023-08-24 02:42:27,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:42:27,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:42:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:42:29,821 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 02:42:29,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:42:29,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757455562] [2023-08-24 02:42:29,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757455562] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:42:29,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63363098] [2023-08-24 02:42:29,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 02:42:29,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:42:29,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:42:29,822 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:42:29,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-24 02:42:29,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 02:42:29,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:42:29,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 117 conjunts are in the unsatisfiable core [2023-08-24 02:42:29,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:42:29,974 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 34 treesize of output 32 [2023-08-24 02:42:30,263 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-24 02:42:30,322 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 6 treesize of output 5 [2023-08-24 02:42:30,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:42:30,506 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 02:42:30,506 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2023-08-24 02:42:30,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:42:30,568 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-24 02:42:30,568 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 25 [2023-08-24 02:42:30,888 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 02:42:30,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:42:30,908 INFO L322 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-08-24 02:42:30,908 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 37 [2023-08-24 02:42:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 02:42:30,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:42:31,421 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse3 (+ c_~A~0.offset .cse10)) (.cse4 (+ .cse10 c_~B~0.offset))) (and (forall ((v_ArrVal_1206 (Array Int Int)) (~M~0 Int)) (or (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1206))) (let ((.cse2 (select .cse5 c_~A~0.base)) (.cse0 (select .cse5 c_~B~0.base))) (< (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ .cse1 c_~B~0.offset)) c_~res2~0 (select .cse2 (+ c_~A~0.offset .cse1)) (select .cse0 c_~B~0.offset) (select .cse2 c_~A~0.offset))) (+ (select .cse2 .cse3) c_~res1~0 (select .cse0 .cse4) 1)))) (<= c_~N~0 ~M~0) (<= ~M~0 0))) (forall ((v_ArrVal_1206 (Array Int Int)) (~M~0 Int)) (or (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1206))) (let ((.cse7 (select .cse9 c_~B~0.base)) (.cse6 (select .cse9 c_~A~0.base))) (<= (+ (select .cse6 .cse3) c_~res1~0 (select .cse7 .cse4)) (let ((.cse8 (* ~M~0 4))) (+ (select .cse7 (+ .cse8 c_~B~0.offset)) c_~res2~0 (select .cse6 (+ c_~A~0.offset .cse8)) (select .cse7 c_~B~0.offset) (select .cse6 c_~A~0.offset)))))) (<= c_~N~0 ~M~0) (<= ~M~0 0)))))) is different from false [2023-08-24 02:42:31,466 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse3 (+ .cse10 c_~B~0.offset)) (.cse4 (+ c_~A~0.offset .cse10))) (and (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (~M~0 Int)) (or (<= c_~N~0 ~M~0) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1205) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1206))) (let ((.cse0 (select .cse5 c_~B~0.base)) (.cse2 (select .cse5 c_~A~0.base))) (< (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ .cse1 c_~B~0.offset)) (select .cse2 c_~A~0.offset) (select .cse0 c_~B~0.offset) c_~res2~0 (select .cse2 (+ c_~A~0.offset .cse1)))) (+ c_~res1~0 (select .cse0 .cse3) 1 (select .cse2 .cse4))))) (<= ~M~0 0))) (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (~M~0 Int)) (or (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1205) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1206))) (let ((.cse6 (select .cse9 c_~B~0.base)) (.cse7 (select .cse9 c_~A~0.base))) (<= (+ c_~res1~0 (select .cse6 .cse3) (select .cse7 .cse4)) (let ((.cse8 (* ~M~0 4))) (+ (select .cse6 (+ .cse8 c_~B~0.offset)) (select .cse7 c_~A~0.offset) (select .cse6 c_~B~0.offset) c_~res2~0 (select .cse7 (+ c_~A~0.offset .cse8))))))) (<= c_~N~0 ~M~0) (<= ~M~0 0)))))) is different from false [2023-08-24 02:42:31,498 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse12))) (.cse2 (+ c_~A~0.offset .cse12 4)) (.cse4 (+ .cse12 4 c_~B~0.offset)) (.cse5 (select (select |c_#memory_int| c_~B~0.base) (+ .cse12 c_~B~0.offset)))) (and (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (~M~0 Int)) (or (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1205) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1206))) (let ((.cse3 (select .cse7 c_~B~0.base)) (.cse1 (select .cse7 c_~A~0.base))) (<= (+ .cse0 (select .cse1 .cse2) (select .cse3 .cse4) .cse5 c_~res1~0) (let ((.cse6 (* ~M~0 4))) (+ (select .cse3 (+ .cse6 c_~B~0.offset)) (select .cse1 c_~A~0.offset) (select .cse3 c_~B~0.offset) c_~res2~0 (select .cse1 (+ c_~A~0.offset .cse6))))))) (<= c_~N~0 ~M~0) (<= ~M~0 0))) (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (~M~0 Int)) (or (<= c_~N~0 ~M~0) (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1205) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1206))) (let ((.cse10 (select .cse11 c_~A~0.base)) (.cse8 (select .cse11 c_~B~0.base))) (< (let ((.cse9 (* ~M~0 4))) (+ (select .cse8 (+ .cse9 c_~B~0.offset)) (select .cse10 c_~A~0.offset) (select .cse8 c_~B~0.offset) c_~res2~0 (select .cse10 (+ c_~A~0.offset .cse9)))) (+ .cse0 (select .cse10 .cse2) (select .cse8 .cse4) .cse5 c_~res1~0 1)))) (<= ~M~0 0)))))) is different from false [2023-08-24 02:42:31,521 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse4 (+ 4 c_~B~0.offset)) (.cse5 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (.cse6 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (~M~0 Int)) (or (<= c_~N~0 ~M~0) (<= ~M~0 0) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1205) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1206))) (let ((.cse0 (select .cse7 c_~B~0.base)) (.cse2 (select .cse7 c_~A~0.base))) (< (let ((.cse1 (* ~M~0 4))) (+ (select .cse0 (+ .cse1 c_~B~0.offset)) (select .cse2 c_~A~0.offset) (select .cse0 c_~B~0.offset) c_~res2~0 (select .cse2 (+ c_~A~0.offset .cse1)))) (+ .cse3 (select .cse0 .cse4) .cse5 c_~res1~0 (select .cse2 .cse6) 1)))))) (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (~M~0 Int)) (or (let ((.cse11 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1205) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1206))) (let ((.cse8 (select .cse11 c_~B~0.base)) (.cse9 (select .cse11 c_~A~0.base))) (<= (+ .cse3 (select .cse8 .cse4) .cse5 c_~res1~0 (select .cse9 .cse6)) (let ((.cse10 (* ~M~0 4))) (+ (select .cse8 (+ .cse10 c_~B~0.offset)) (select .cse9 c_~A~0.offset) (select .cse8 c_~B~0.offset) c_~res2~0 (select .cse9 (+ c_~A~0.offset .cse10))))))) (<= c_~N~0 ~M~0) (<= ~M~0 0))))) is different from false [2023-08-24 02:42:31,571 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ c_~A~0.offset 4))) (and (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1204 (Array Int Int)) (~M~0 Int)) (or (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1204))) (let ((.cse6 (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1205) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1206))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse3 (select .cse6 c_~A~0.base))) (<= (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select .cse1 .cse2) (select .cse3 .cse4)) (let ((.cse5 (* ~M~0 4))) (+ c_~res2~0 (select .cse3 c_~A~0.offset) (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse1 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse3 (+ c_~A~0.offset .cse5)))))))) (<= c_~N~0 ~M~0) (<= ~M~0 0))) (forall ((v_ArrVal_1206 (Array Int Int)) (v_ArrVal_1205 (Array Int Int)) (v_ArrVal_1204 (Array Int Int)) (~M~0 Int)) (or (<= c_~N~0 ~M~0) (<= ~M~0 0) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1204))) (let ((.cse11 (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1205) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1206))) (let ((.cse8 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse7 (select .cse11 c_~A~0.base))) (< (let ((.cse9 (* ~M~0 4))) (+ c_~res2~0 (select .cse7 c_~A~0.offset) (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select .cse8 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse7 (+ c_~A~0.offset .cse9)))) (+ (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~res1~0 (select (select .cse10 c_~A~0.base) c_~A~0.offset) (select .cse8 .cse2) (select .cse7 .cse4) 1))))))))) is different from false [2023-08-24 02:42:31,583 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:42:31,583 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 213 treesize of output 130 [2023-08-24 02:42:31,755 INFO L322 Elim1Store]: treesize reduction 16, result has 89.7 percent of original size [2023-08-24 02:42:31,756 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 53750 treesize of output 46209 [2023-08-24 02:42:31,880 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 02:42:31,887 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 02:42:31,947 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:42:31,948 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 2806 treesize of output 2534 [2023-08-24 02:42:32,013 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 02:42:32,022 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 02:42:32,083 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:42:32,084 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 2422 treesize of output 1766 [2023-08-24 02:42:32,154 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 02:42:32,162 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 02:42:32,228 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:42:32,228 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 11 case distinctions, treesize of input 1654 treesize of output 1510 [2023-08-24 02:47:55,423 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:47:55,423 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 214 treesize of output 131 [2023-08-24 02:47:55,429 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 02:47:55,429 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 02:47:55,430 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 02:47:55,430 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 02:47:55,529 INFO L322 Elim1Store]: treesize reduction 91, result has 41.7 percent of original size [2023-08-24 02:47:55,530 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 822 treesize of output 598 [2023-08-24 02:47:55,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:47:55,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:47:55,570 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:47:55,570 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 101 treesize of output 58 [2023-08-24 02:47:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2023-08-24 02:47:56,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63363098] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:47:56,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:47:56,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 17] total 48 [2023-08-24 02:47:56,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242787224] [2023-08-24 02:47:56,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:47:56,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-08-24 02:47:56,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:47:56,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-08-24 02:47:56,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1826, Unknown=5, NotChecked=450, Total=2450 [2023-08-24 02:47:56,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 362 [2023-08-24 02:47:56,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 2280 transitions, 56349 flow. Second operand has 50 states, 50 states have (on average 86.5) internal successors, (4325), 50 states have internal predecessors, (4325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:47:56,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:47:56,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 362 [2023-08-24 02:47:56,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:48:16,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:48:21,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:48:23,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:48:25,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:48:41,854 INFO L124 PetriNetUnfolderBase]: 31264/44092 cut-off events. [2023-08-24 02:48:41,855 INFO L125 PetriNetUnfolderBase]: For 1351753/1351753 co-relation queries the response was YES. [2023-08-24 02:48:42,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504643 conditions, 44092 events. 31264/44092 cut-off events. For 1351753/1351753 co-relation queries the response was YES. Maximal size of possible extension queue 1562. Compared 271878 event pairs, 1699 based on Foata normal form. 4/44096 useless extension candidates. Maximal degree in co-relation 504556. Up to 24548 conditions per place. [2023-08-24 02:48:43,008 INFO L140 encePairwiseOnDemand]: 343/362 looper letters, 3786 selfloop transitions, 3323 changer transitions 58/7167 dead transitions. [2023-08-24 02:48:43,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 7167 transitions, 186324 flow [2023-08-24 02:48:43,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2023-08-24 02:48:43,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2023-08-24 02:48:43,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 9904 transitions. [2023-08-24 02:48:43,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25810486813301364 [2023-08-24 02:48:43,020 INFO L72 ComplementDD]: Start complementDD. Operand 106 states and 9904 transitions. [2023-08-24 02:48:43,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 9904 transitions. [2023-08-24 02:48:43,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:48:43,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 106 states and 9904 transitions. [2023-08-24 02:48:43,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 107 states, 106 states have (on average 93.43396226415095) internal successors, (9904), 106 states have internal predecessors, (9904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:48:43,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 107 states, 107 states have (on average 362.0) internal successors, (38734), 107 states have internal predecessors, (38734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:48:43,065 INFO L81 ComplementDD]: Finished complementDD. Result has 107 states, 107 states have (on average 362.0) internal successors, (38734), 107 states have internal predecessors, (38734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:48:43,065 INFO L175 Difference]: Start difference. First operand has 337 places, 2280 transitions, 56349 flow. Second operand 106 states and 9904 transitions. [2023-08-24 02:48:43,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 7167 transitions, 186324 flow [2023-08-24 02:49:07,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 7167 transitions, 178492 flow, removed 153 selfloop flow, removed 13 redundant places. [2023-08-24 02:49:07,193 INFO L231 Difference]: Finished difference. Result has 490 places, 5587 transitions, 147711 flow [2023-08-24 02:49:07,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=53725, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=643, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=106, PETRI_FLOW=147711, PETRI_PLACES=490, PETRI_TRANSITIONS=5587} [2023-08-24 02:49:07,196 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 457 predicate places. [2023-08-24 02:49:07,196 INFO L495 AbstractCegarLoop]: Abstraction has has 490 places, 5587 transitions, 147711 flow [2023-08-24 02:49:07,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 86.5) internal successors, (4325), 50 states have internal predecessors, (4325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:49:07,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:49:07,196 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:49:07,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-24 02:49:07,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-24 02:49:07,397 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:49:07,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:49:07,399 INFO L85 PathProgramCache]: Analyzing trace with hash 586470184, now seen corresponding path program 3 times [2023-08-24 02:49:07,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:49:07,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177922374] [2023-08-24 02:49:07,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:49:07,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:49:07,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:49:08,920 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 02:49:08,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:49:08,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177922374] [2023-08-24 02:49:08,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177922374] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:49:08,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357236791] [2023-08-24 02:49:08,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 02:49:08,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:49:08,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:49:08,921 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:49:08,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-24 02:49:09,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 02:49:09,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:49:09,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 108 conjunts are in the unsatisfiable core [2023-08-24 02:49:09,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:49:09,351 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-24 02:49:09,395 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 6 treesize of output 5 [2023-08-24 02:49:09,447 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 6 treesize of output 5 [2023-08-24 02:49:09,495 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 6 treesize of output 5 [2023-08-24 02:49:09,832 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 02:49:09,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:49:09,856 INFO L322 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-08-24 02:49:09,856 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 37 [2023-08-24 02:49:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 02:49:09,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:49:24,776 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:49:24,777 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 121 treesize of output 86 [2023-08-24 02:49:24,821 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:49:24,821 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 20470 treesize of output 18750 [2023-08-24 02:49:24,909 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:49:24,909 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 2326 treesize of output 2066 [2023-08-24 02:49:24,970 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:49:24,971 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 2006 treesize of output 1906 [2023-08-24 02:49:25,039 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:49:25,039 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 1846 treesize of output 1266 [2023-08-24 02:49:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:49:39,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357236791] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:49:39,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:49:39,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 17] total 49 [2023-08-24 02:49:39,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665044592] [2023-08-24 02:49:39,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:49:39,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-08-24 02:49:39,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:49:39,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-08-24 02:49:39,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2211, Unknown=34, NotChecked=0, Total=2550 [2023-08-24 02:49:39,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 362 [2023-08-24 02:49:39,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 5587 transitions, 147711 flow. Second operand has 51 states, 51 states have (on average 86.54901960784314) internal successors, (4414), 51 states have internal predecessors, (4414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:49:39,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:49:39,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 362 [2023-08-24 02:49:39,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:49:42,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:49:51,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:50:54,492 INFO L124 PetriNetUnfolderBase]: 42112/59785 cut-off events. [2023-08-24 02:50:54,492 INFO L125 PetriNetUnfolderBase]: For 2069103/2069103 co-relation queries the response was YES. [2023-08-24 02:50:56,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733456 conditions, 59785 events. 42112/59785 cut-off events. For 2069103/2069103 co-relation queries the response was YES. Maximal size of possible extension queue 1994. Compared 388111 event pairs, 2321 based on Foata normal form. 6/59791 useless extension candidates. Maximal degree in co-relation 733315. Up to 38908 conditions per place. [2023-08-24 02:50:57,190 INFO L140 encePairwiseOnDemand]: 344/362 looper letters, 4268 selfloop transitions, 4396 changer transitions 3/8667 dead transitions. [2023-08-24 02:50:57,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 8667 transitions, 237427 flow [2023-08-24 02:50:57,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2023-08-24 02:50:57,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2023-08-24 02:50:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 7948 transitions. [2023-08-24 02:50:57,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26137858458300445 [2023-08-24 02:50:57,195 INFO L72 ComplementDD]: Start complementDD. Operand 84 states and 7948 transitions. [2023-08-24 02:50:57,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 7948 transitions. [2023-08-24 02:50:57,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:50:57,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 84 states and 7948 transitions. [2023-08-24 02:50:57,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 85 states, 84 states have (on average 94.61904761904762) internal successors, (7948), 84 states have internal predecessors, (7948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:50:57,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 85 states, 85 states have (on average 362.0) internal successors, (30770), 85 states have internal predecessors, (30770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:50:57,216 INFO L81 ComplementDD]: Finished complementDD. Result has 85 states, 85 states have (on average 362.0) internal successors, (30770), 85 states have internal predecessors, (30770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:50:57,216 INFO L175 Difference]: Start difference. First operand has 490 places, 5587 transitions, 147711 flow. Second operand 84 states and 7948 transitions. [2023-08-24 02:50:57,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 8667 transitions, 237427 flow [2023-08-24 02:52:17,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 8667 transitions, 226027 flow, removed 5694 selfloop flow, removed 9 redundant places. [2023-08-24 02:52:17,642 INFO L231 Difference]: Finished difference. Result has 596 places, 7693 transitions, 207896 flow [2023-08-24 02:52:17,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=139977, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2523, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=84, PETRI_FLOW=207896, PETRI_PLACES=596, PETRI_TRANSITIONS=7693} [2023-08-24 02:52:17,648 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 563 predicate places. [2023-08-24 02:52:17,648 INFO L495 AbstractCegarLoop]: Abstraction has has 596 places, 7693 transitions, 207896 flow [2023-08-24 02:52:17,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 86.54901960784314) internal successors, (4414), 51 states have internal predecessors, (4414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:52:17,649 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:52:17,649 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:52:17,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-24 02:52:17,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:52:17,857 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 02:52:17,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:52:17,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1019052926, now seen corresponding path program 4 times [2023-08-24 02:52:17,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:52:17,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524214644] [2023-08-24 02:52:17,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:52:17,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:52:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:52:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:52:19,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:52:19,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524214644] [2023-08-24 02:52:19,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524214644] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:52:19,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186770374] [2023-08-24 02:52:19,364 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 02:52:19,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:52:19,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:52:19,365 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:52:19,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-24 02:52:19,516 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 02:52:19,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:52:19,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 97 conjunts are in the unsatisfiable core [2023-08-24 02:52:19,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:52:20,205 INFO L322 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2023-08-24 02:52:20,205 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 71 [2023-08-24 02:52:20,499 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:52:20,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:52:21,255 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:52:21,256 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 71 treesize of output 342 Received shutdown request... [2023-08-24 02:52:22,544 WARN L266 SmtUtils]: Removed 2 from assertion stack [2023-08-24 02:52:22,546 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-24 02:52:22,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-08-24 02:52:22,571 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 02:52:22,578 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 02:52:22,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:52:22,753 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 32 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 5ms.. [2023-08-24 02:52:22,754 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-08-24 02:52:22,754 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-08-24 02:52:22,755 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-08-24 02:52:22,755 INFO L445 BasicCegarLoop]: Path program histogram: [16, 4, 2, 1, 1] [2023-08-24 02:52:22,758 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 02:52:22,758 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 02:52:22,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 02:52:22 BasicIcfg [2023-08-24 02:52:22,762 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 02:52:22,762 INFO L158 Benchmark]: Toolchain (without parser) took 797890.75ms. Allocated memory was 425.7MB in the beginning and 9.0GB in the end (delta: 8.5GB). Free memory was 401.9MB in the beginning and 5.0GB in the end (delta: -4.6GB). Peak memory consumption was 4.0GB. Max. memory is 16.0GB. [2023-08-24 02:52:22,762 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 425.7MB. Free memory was 402.4MB in the beginning and 402.3MB in the end (delta: 77.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 02:52:22,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.68ms. Allocated memory is still 425.7MB. Free memory was 401.5MB in the beginning and 389.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-24 02:52:22,763 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.63ms. Allocated memory is still 425.7MB. Free memory was 389.7MB in the beginning and 387.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 02:52:22,763 INFO L158 Benchmark]: Boogie Preprocessor took 40.04ms. Allocated memory is still 425.7MB. Free memory was 387.2MB in the beginning and 385.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 02:52:22,763 INFO L158 Benchmark]: RCFGBuilder took 910.21ms. Allocated memory is still 425.7MB. Free memory was 384.8MB in the beginning and 382.5MB in the end (delta: 2.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.0GB. [2023-08-24 02:52:22,763 INFO L158 Benchmark]: TraceAbstraction took 796586.15ms. Allocated memory was 425.7MB in the beginning and 9.0GB in the end (delta: 8.5GB). Free memory was 381.6MB in the beginning and 5.0GB in the end (delta: -4.6GB). Peak memory consumption was 3.9GB. Max. memory is 16.0GB. [2023-08-24 02:52:22,765 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.14ms. Allocated memory is still 425.7MB. Free memory was 402.4MB in the beginning and 402.3MB in the end (delta: 77.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 285.68ms. Allocated memory is still 425.7MB. Free memory was 401.5MB in the beginning and 389.7MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 63.63ms. Allocated memory is still 425.7MB. Free memory was 389.7MB in the beginning and 387.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 40.04ms. Allocated memory is still 425.7MB. Free memory was 387.2MB in the beginning and 385.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 910.21ms. Allocated memory is still 425.7MB. Free memory was 384.8MB in the beginning and 382.5MB in the end (delta: 2.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.0GB. * TraceAbstraction took 796586.15ms. Allocated memory was 425.7MB in the beginning and 9.0GB in the end (delta: 8.5GB). Free memory was 381.6MB in the beginning and 5.0GB in the end (delta: -4.6GB). Peak memory consumption was 3.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 169 PlacesBefore, 33 PlacesAfterwards, 175 TransitionsBefore, 28 TransitionsAfterwards, 1728 CoEnabledTransitionPairs, 7 FixpointIterations, 100 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 6 ConcurrentYvCompositions, 11 ChoiceCompositions, 174 TotalNumberOfCompositions, 2271 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1929, independent: 1883, independent conditional: 0, independent unconditional: 1883, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 929, independent: 915, independent conditional: 0, independent unconditional: 915, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1929, independent: 968, independent conditional: 0, independent unconditional: 968, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 929, unknown conditional: 0, unknown unconditional: 929] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 74, Positive conditional cache size: 0, Positive unconditional cache size: 74, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 32 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 5ms.. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 32 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 5ms.. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 32 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 5ms.. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 32 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 5ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 209 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 796.5s, OverallIterations: 24, TraceHistogramMax: 2, PathProgramHistogramMax: 16, EmptinessCheckTime: 0.0s, AutomataDifference: 322.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 5325 SdHoareTripleChecker+Valid, 31.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5325 mSDsluCounter, 1582 SdHoareTripleChecker+Invalid, 29.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 5156 IncrementalHoareTripleChecker+Unchecked, 1439 mSDsCounter, 544 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29726 IncrementalHoareTripleChecker+Invalid, 35432 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 544 mSolverCounterUnsat, 143 mSDtfsCounter, 29726 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1916 GetRequests, 855 SyntacticMatches, 39 SemanticMatches, 1022 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 19264 ImplicationChecksByTransitivity, 62.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207896occurred in iteration=23, InterpolantAutomatonStates: 700, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 454.1s InterpolantComputationTime, 1229 NumberOfCodeBlocks, 1222 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 1743 ConstructedInterpolants, 38 QuantifiedInterpolants, 18674 SizeOfPredicates, 308 NumberOfNonLiveVariables, 7016 ConjunctsInSsa, 685 ConjunctsInUnsatCore, 66 InterpolantComputations, 4 PerfectInterpolantSequences, 253/453 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown