/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 16:17:24,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 16:17:24,978 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-SemanticLbe.epf [2023-11-17 16:17:25,001 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 16:17:25,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 16:17:25,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 16:17:25,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 16:17:25,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 16:17:25,003 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 16:17:25,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 16:17:25,006 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 16:17:25,006 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 16:17:25,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 16:17:25,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 16:17:25,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 16:17:25,008 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 16:17:25,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 16:17:25,008 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 16:17:25,008 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 16:17:25,008 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 16:17:25,009 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 16:17:25,009 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 16:17:25,009 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 16:17:25,009 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 16:17:25,010 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 16:17:25,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:17:25,010 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 16:17:25,010 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 16:17:25,010 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 16:17:25,010 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 16:17:25,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 16:17:25,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 16:17:25,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-11-17 16:17:25,191 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 16:17:25,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 16:17:25,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 16:17:25,207 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 16:17:25,208 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 16:17:25,208 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-11-17 16:17:26,126 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 16:17:26,266 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 16:17:26,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum.wvr.c [2023-11-17 16:17:26,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf96be60/43f4c7963fd948d59709edb412a5ff89/FLAGe4e1bf8ac [2023-11-17 16:17:26,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9bf96be60/43f4c7963fd948d59709edb412a5ff89 [2023-11-17 16:17:26,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 16:17:26,287 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 16:17:26,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 16:17:26,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 16:17:26,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 16:17:26,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:17:26" (1/1) ... [2023-11-17 16:17:26,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b643fe7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:17:26, skipping insertion in model container [2023-11-17 16:17:26,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:17:26" (1/1) ... [2023-11-17 16:17:26,310 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 16:17:26,414 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[2874,2887] [2023-11-17 16:17:26,420 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:17:26,426 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 16:17:26,448 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[2874,2887] [2023-11-17 16:17:26,451 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:17:26,456 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:17:26,456 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:17:26,460 INFO L206 MainTranslator]: Completed translation [2023-11-17 16:17:26,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:17:26 WrapperNode [2023-11-17 16:17:26,461 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 16:17:26,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 16:17:26,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 16:17:26,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 16:17:26,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:17:26" (1/1) ... [2023-11-17 16:17:26,473 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:17:26" (1/1) ... [2023-11-17 16:17:26,492 INFO L138 Inliner]: procedures = 25, calls = 58, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 291 [2023-11-17 16:17:26,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 16:17:26,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 16:17:26,496 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 16:17:26,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 16:17:26,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:17:26" (1/1) ... [2023-11-17 16:17:26,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:17:26" (1/1) ... [2023-11-17 16:17:26,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:17:26" (1/1) ... [2023-11-17 16:17:26,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:17:26" (1/1) ... [2023-11-17 16:17:26,516 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:17:26" (1/1) ... [2023-11-17 16:17:26,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:17:26" (1/1) ... [2023-11-17 16:17:26,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:17:26" (1/1) ... [2023-11-17 16:17:26,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:17:26" (1/1) ... [2023-11-17 16:17:26,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 16:17:26,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 16:17:26,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 16:17:26,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 16:17:26,524 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:17:26" (1/1) ... [2023-11-17 16:17:26,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:17:26,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:17:26,545 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-11-17 16:17:26,553 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-11-17 16:17:26,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 16:17:26,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 16:17:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 16:17:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 16:17:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 16:17:26,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 16:17:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 16:17:26,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 16:17:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 16:17:26,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 16:17:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 16:17:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 16:17:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 16:17:26,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 16:17:26,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 16:17:26,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 16:17:26,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 16:17:26,568 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 16:17:26,645 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 16:17:26,646 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 16:17:26,950 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 16:17:27,149 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 16:17:27,149 INFO L307 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-17 16:17:27,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:17:27 BoogieIcfgContainer [2023-11-17 16:17:27,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 16:17:27,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 16:17:27,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 16:17:27,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 16:17:27,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:17:26" (1/3) ... [2023-11-17 16:17:27,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e3d95e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:17:27, skipping insertion in model container [2023-11-17 16:17:27,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:17:26" (2/3) ... [2023-11-17 16:17:27,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61e3d95e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:17:27, skipping insertion in model container [2023-11-17 16:17:27,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:17:27" (3/3) ... [2023-11-17 16:17:27,157 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum.wvr.c [2023-11-17 16:17:27,168 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 16:17:27,168 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 16:17:27,169 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 16:17:27,220 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 16:17:27,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 204 transitions, 429 flow [2023-11-17 16:17:27,342 INFO L124 PetriNetUnfolderBase]: 16/201 cut-off events. [2023-11-17 16:17:27,343 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:17:27,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 201 events. 16/201 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 132 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 160. Up to 2 conditions per place. [2023-11-17 16:17:27,347 INFO L82 GeneralOperation]: Start removeDead. Operand has 198 places, 204 transitions, 429 flow [2023-11-17 16:17:27,350 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 190 transitions, 398 flow [2023-11-17 16:17:27,352 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 16:17:27,367 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 190 transitions, 398 flow [2023-11-17 16:17:27,370 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 190 transitions, 398 flow [2023-11-17 16:17:27,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 190 transitions, 398 flow [2023-11-17 16:17:27,409 INFO L124 PetriNetUnfolderBase]: 16/190 cut-off events. [2023-11-17 16:17:27,409 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:17:27,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 190 events. 16/190 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 129 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 160. Up to 2 conditions per place. [2023-11-17 16:17:27,412 INFO L119 LiptonReduction]: Number of co-enabled transitions 1950 [2023-11-17 16:17:31,847 INFO L134 LiptonReduction]: Checked pairs total: 2550 [2023-11-17 16:17:31,848 INFO L136 LiptonReduction]: Total number of compositions: 195 [2023-11-17 16:17:31,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 16:17:31,861 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=LoopHeads, 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;@92b256e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:17:31,862 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 16:17:31,865 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 16:17:31,865 INFO L124 PetriNetUnfolderBase]: 5/27 cut-off events. [2023-11-17 16:17:31,865 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:17:31,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:17:31,866 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-11-17 16:17:31,866 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-11-17 16:17:31,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:17:31,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1926974866, now seen corresponding path program 1 times [2023-11-17 16:17:31,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:17:31,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075618606] [2023-11-17 16:17:31,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:17:31,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:17:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:17:32,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:17:32,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:17:32,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075618606] [2023-11-17 16:17:32,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075618606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:17:32,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:17:32,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 16:17:32,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211512257] [2023-11-17 16:17:32,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:17:32,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:17:32,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:17:32,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:17:32,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:17:32,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 399 [2023-11-17 16:17:32,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:32,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:17:32,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 399 [2023-11-17 16:17:32,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:17:32,353 INFO L124 PetriNetUnfolderBase]: 724/1056 cut-off events. [2023-11-17 16:17:32,353 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2023-11-17 16:17:32,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2217 conditions, 1056 events. 724/1056 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3826 event pairs, 253 based on Foata normal form. 1/827 useless extension candidates. Maximal degree in co-relation 1702. Up to 632 conditions per place. [2023-11-17 16:17:32,359 INFO L140 encePairwiseOnDemand]: 394/399 looper letters, 44 selfloop transitions, 4 changer transitions 1/49 dead transitions. [2023-11-17 16:17:32,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 49 transitions, 229 flow [2023-11-17 16:17:32,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:17:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:17:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 581 transitions. [2023-11-17 16:17:32,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853801169590643 [2023-11-17 16:17:32,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 581 transitions. [2023-11-17 16:17:32,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 581 transitions. [2023-11-17 16:17:32,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:17:32,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 581 transitions. [2023-11-17 16:17:32,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:32,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:32,389 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 399.0) internal successors, (1596), 4 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:32,390 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 74 flow. Second operand 3 states and 581 transitions. [2023-11-17 16:17:32,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 49 transitions, 229 flow [2023-11-17 16:17:32,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 49 transitions, 207 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-17 16:17:32,395 INFO L231 Difference]: Finished difference. Result has 30 places, 31 transitions, 88 flow [2023-11-17 16:17:32,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=30, PETRI_TRANSITIONS=31} [2023-11-17 16:17:32,399 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, -3 predicate places. [2023-11-17 16:17:32,399 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 31 transitions, 88 flow [2023-11-17 16:17:32,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:32,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:17:32,400 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] [2023-11-17 16:17:32,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 16:17:32,401 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-11-17 16:17:32,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:17:32,401 INFO L85 PathProgramCache]: Analyzing trace with hash 781782094, now seen corresponding path program 1 times [2023-11-17 16:17:32,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:17:32,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264672950] [2023-11-17 16:17:32,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:17:32,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:17:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:17:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:17:32,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:17:32,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264672950] [2023-11-17 16:17:32,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264672950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:17:32,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:17:32,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:17:32,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68131271] [2023-11-17 16:17:32,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:17:32,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:17:32,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:17:32,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:17:32,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:17:32,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 399 [2023-11-17 16:17:32,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 31 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:32,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:17:32,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 399 [2023-11-17 16:17:32,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:17:32,706 INFO L124 PetriNetUnfolderBase]: 724/1059 cut-off events. [2023-11-17 16:17:32,706 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2023-11-17 16:17:32,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2495 conditions, 1059 events. 724/1059 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3639 event pairs, 506 based on Foata normal form. 1/913 useless extension candidates. Maximal degree in co-relation 875. Up to 1057 conditions per place. [2023-11-17 16:17:32,713 INFO L140 encePairwiseOnDemand]: 394/399 looper letters, 29 selfloop transitions, 4 changer transitions 1/34 dead transitions. [2023-11-17 16:17:32,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 162 flow [2023-11-17 16:17:32,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:17:32,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 16:17:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 626 transitions. [2023-11-17 16:17:32,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39223057644110276 [2023-11-17 16:17:32,715 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 626 transitions. [2023-11-17 16:17:32,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 626 transitions. [2023-11-17 16:17:32,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:17:32,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 626 transitions. [2023-11-17 16:17:32,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.5) internal successors, (626), 4 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:32,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:32,719 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:32,719 INFO L175 Difference]: Start difference. First operand has 30 places, 31 transitions, 88 flow. Second operand 4 states and 626 transitions. [2023-11-17 16:17:32,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 162 flow [2023-11-17 16:17:32,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 34 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:17:32,721 INFO L231 Difference]: Finished difference. Result has 34 places, 33 transitions, 110 flow [2023-11-17 16:17:32,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=34, PETRI_TRANSITIONS=33} [2023-11-17 16:17:32,722 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2023-11-17 16:17:32,722 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 33 transitions, 110 flow [2023-11-17 16:17:32,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:32,723 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:17:32,724 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-11-17 16:17:32,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 16:17:32,726 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-11-17 16:17:32,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:17:32,731 INFO L85 PathProgramCache]: Analyzing trace with hash -952916473, now seen corresponding path program 1 times [2023-11-17 16:17:32,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:17:32,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543558578] [2023-11-17 16:17:32,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:17:32,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:17:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:17:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:17:32,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:17:32,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543558578] [2023-11-17 16:17:32,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543558578] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:17:32,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:17:32,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 16:17:32,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084553382] [2023-11-17 16:17:32,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:17:32,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:17:32,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:17:32,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:17:32,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:17:32,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 399 [2023-11-17 16:17:32,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 33 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:32,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:17:32,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 399 [2023-11-17 16:17:32,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:17:32,964 INFO L124 PetriNetUnfolderBase]: 719/1050 cut-off events. [2023-11-17 16:17:32,964 INFO L125 PetriNetUnfolderBase]: For 153/153 co-relation queries the response was YES. [2023-11-17 16:17:32,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2376 conditions, 1050 events. 719/1050 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3684 event pairs, 258 based on Foata normal form. 0/939 useless extension candidates. Maximal degree in co-relation 2352. Up to 571 conditions per place. [2023-11-17 16:17:32,968 INFO L140 encePairwiseOnDemand]: 394/399 looper letters, 43 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2023-11-17 16:17:32,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 48 transitions, 246 flow [2023-11-17 16:17:32,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:17:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 16:17:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 706 transitions. [2023-11-17 16:17:32,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423558897243108 [2023-11-17 16:17:32,971 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 706 transitions. [2023-11-17 16:17:32,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 706 transitions. [2023-11-17 16:17:32,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:17:32,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 706 transitions. [2023-11-17 16:17:32,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 176.5) internal successors, (706), 4 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:32,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:32,975 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 399.0) internal successors, (1995), 5 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:32,975 INFO L175 Difference]: Start difference. First operand has 34 places, 33 transitions, 110 flow. Second operand 4 states and 706 transitions. [2023-11-17 16:17:32,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 48 transitions, 246 flow [2023-11-17 16:17:32,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 236 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-17 16:17:32,977 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 125 flow [2023-11-17 16:17:32,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2023-11-17 16:17:32,978 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2023-11-17 16:17:32,978 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 125 flow [2023-11-17 16:17:32,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:32,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:17:32,978 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] [2023-11-17 16:17:32,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 16:17:32,979 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-11-17 16:17:32,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:17:32,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1611567950, now seen corresponding path program 1 times [2023-11-17 16:17:32,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:17:32,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270527806] [2023-11-17 16:17:32,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:17:32,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:17:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:17:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:17:33,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:17:33,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270527806] [2023-11-17 16:17:33,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270527806] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:17:33,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348845402] [2023-11-17 16:17:33,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:17:33,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:17:33,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:17:33,099 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-11-17 16:17:33,103 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-11-17 16:17:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:17:33,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 16:17:33,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:17:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:17:33,255 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:17:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:17:33,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348845402] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 16:17:33,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 16:17:33,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2023-11-17 16:17:33,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014536553] [2023-11-17 16:17:33,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:17:33,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 16:17:33,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:17:33,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 16:17:33,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-17 16:17:33,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 399 [2023-11-17 16:17:33,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:33,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:17:33,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 399 [2023-11-17 16:17:33,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:17:33,398 INFO L124 PetriNetUnfolderBase]: 689/998 cut-off events. [2023-11-17 16:17:33,399 INFO L125 PetriNetUnfolderBase]: For 539/539 co-relation queries the response was YES. [2023-11-17 16:17:33,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2701 conditions, 998 events. 689/998 cut-off events. For 539/539 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3441 event pairs, 327 based on Foata normal form. 76/999 useless extension candidates. Maximal degree in co-relation 2671. Up to 741 conditions per place. [2023-11-17 16:17:33,403 INFO L140 encePairwiseOnDemand]: 394/399 looper letters, 46 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2023-11-17 16:17:33,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 293 flow [2023-11-17 16:17:33,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:17:33,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 16:17:33,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 764 transitions. [2023-11-17 16:17:33,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3829573934837093 [2023-11-17 16:17:33,406 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 764 transitions. [2023-11-17 16:17:33,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 764 transitions. [2023-11-17 16:17:33,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:17:33,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 764 transitions. [2023-11-17 16:17:33,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:33,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 399.0) internal successors, (2394), 6 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:33,411 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 399.0) internal successors, (2394), 6 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:33,411 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 125 flow. Second operand 5 states and 764 transitions. [2023-11-17 16:17:33,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 293 flow [2023-11-17 16:17:33,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 16:17:33,415 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 141 flow [2023-11-17 16:17:33,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2023-11-17 16:17:33,416 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2023-11-17 16:17:33,416 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 141 flow [2023-11-17 16:17:33,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:33,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:17:33,417 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-11-17 16:17:33,425 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-11-17 16:17:33,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:17:33,625 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-11-17 16:17:33,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:17:33,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2013477700, now seen corresponding path program 1 times [2023-11-17 16:17:33,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:17:33,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375249440] [2023-11-17 16:17:33,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:17:33,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:17:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:17:34,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:17:34,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:17:34,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375249440] [2023-11-17 16:17:34,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375249440] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:17:34,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076119139] [2023-11-17 16:17:34,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:17:34,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:17:34,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:17:34,524 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-11-17 16:17:34,552 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-11-17 16:17:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:17:34,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-17 16:17:34,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:17:34,674 INFO L378 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 84 treesize of output 82 [2023-11-17 16:17:34,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:17:34,975 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 16:17:34,975 INFO L378 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 22 treesize of output 20 [2023-11-17 16:17:35,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:17:35,076 INFO L378 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-11-17 16:17:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:17:35,102 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:17:35,172 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_136 (Array Int Int))) (= c_~res1~0 (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_136)) (.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-11-17 16:17:35,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:17:35,219 INFO L378 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 186 treesize of output 166 [2023-11-17 16:17:35,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:17:35,239 INFO L378 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 90 treesize of output 74 [2023-11-17 16:17:35,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:17:35,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076119139] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:17:35,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:17:35,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2023-11-17 16:17:35,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820371532] [2023-11-17 16:17:35,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:17:35,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-17 16:17:35,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:17:35,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-17 16:17:35,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=728, Unknown=1, NotChecked=54, Total=870 [2023-11-17 16:17:35,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 399 [2023-11-17 16:17:35,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 141 flow. Second operand has 30 states, 30 states have (on average 103.16666666666667) internal successors, (3095), 30 states have internal predecessors, (3095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:35,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:17:35,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 399 [2023-11-17 16:17:35,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:17:37,465 INFO L124 PetriNetUnfolderBase]: 1860/2708 cut-off events. [2023-11-17 16:17:37,465 INFO L125 PetriNetUnfolderBase]: For 1831/1831 co-relation queries the response was YES. [2023-11-17 16:17:37,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7926 conditions, 2708 events. 1860/2708 cut-off events. For 1831/1831 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 11549 event pairs, 154 based on Foata normal form. 2/2506 useless extension candidates. Maximal degree in co-relation 6011. Up to 1189 conditions per place. [2023-11-17 16:17:37,479 INFO L140 encePairwiseOnDemand]: 384/399 looper letters, 180 selfloop transitions, 69 changer transitions 2/251 dead transitions. [2023-11-17 16:17:37,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 251 transitions, 1348 flow [2023-11-17 16:17:37,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-17 16:17:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-11-17 16:17:37,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2978 transitions. [2023-11-17 16:17:37,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2764318202914694 [2023-11-17 16:17:37,485 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 2978 transitions. [2023-11-17 16:17:37,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 2978 transitions. [2023-11-17 16:17:37,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:17:37,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 2978 transitions. [2023-11-17 16:17:37,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 110.29629629629629) internal successors, (2978), 27 states have internal predecessors, (2978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:37,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 399.0) internal successors, (11172), 28 states have internal predecessors, (11172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:37,501 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 399.0) internal successors, (11172), 28 states have internal predecessors, (11172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:37,501 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 141 flow. Second operand 27 states and 2978 transitions. [2023-11-17 16:17:37,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 251 transitions, 1348 flow [2023-11-17 16:17:37,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 251 transitions, 1332 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 16:17:37,506 INFO L231 Difference]: Finished difference. Result has 71 places, 98 transitions, 655 flow [2023-11-17 16:17:37,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=655, PETRI_PLACES=71, PETRI_TRANSITIONS=98} [2023-11-17 16:17:37,507 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 38 predicate places. [2023-11-17 16:17:37,507 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 98 transitions, 655 flow [2023-11-17 16:17:37,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 103.16666666666667) internal successors, (3095), 30 states have internal predecessors, (3095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:37,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:17:37,508 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-11-17 16:17:37,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-17 16:17:37,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:17:37,715 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-11-17 16:17:37,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:17:37,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1374199368, now seen corresponding path program 2 times [2023-11-17 16:17:37,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:17:37,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250866820] [2023-11-17 16:17:37,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:17:37,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:17:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:17:38,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:17:38,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:17:38,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250866820] [2023-11-17 16:17:38,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250866820] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:17:38,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793355109] [2023-11-17 16:17:38,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:17:38,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:17:38,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:17:38,181 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-11-17 16:17:38,209 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-11-17 16:17:38,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:17:38,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:17:38,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-17 16:17:38,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:17:38,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:17:38,519 INFO L378 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-11-17 16:17:38,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:17:38,543 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:17:38,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:17:38,614 INFO L378 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-11-17 16:17:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:17:38,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793355109] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:17:38,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:17:38,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 25 [2023-11-17 16:17:38,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614144319] [2023-11-17 16:17:38,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:17:38,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-17 16:17:38,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:17:38,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-17 16:17:38,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2023-11-17 16:17:38,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 399 [2023-11-17 16:17:38,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 98 transitions, 655 flow. Second operand has 27 states, 27 states have (on average 112.48148148148148) internal successors, (3037), 27 states have internal predecessors, (3037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:38,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:17:38,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 399 [2023-11-17 16:17:38,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:17:40,540 INFO L124 PetriNetUnfolderBase]: 3182/4592 cut-off events. [2023-11-17 16:17:40,541 INFO L125 PetriNetUnfolderBase]: For 8369/8369 co-relation queries the response was YES. [2023-11-17 16:17:40,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17142 conditions, 4592 events. 3182/4592 cut-off events. For 8369/8369 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 21248 event pairs, 406 based on Foata normal form. 2/4311 useless extension candidates. Maximal degree in co-relation 16330. Up to 2717 conditions per place. [2023-11-17 16:17:40,572 INFO L140 encePairwiseOnDemand]: 383/399 looper letters, 229 selfloop transitions, 215 changer transitions 2/446 dead transitions. [2023-11-17 16:17:40,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 446 transitions, 3469 flow [2023-11-17 16:17:40,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-17 16:17:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-11-17 16:17:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 4698 transitions. [2023-11-17 16:17:40,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2943609022556391 [2023-11-17 16:17:40,586 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 4698 transitions. [2023-11-17 16:17:40,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 4698 transitions. [2023-11-17 16:17:40,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:17:40,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 4698 transitions. [2023-11-17 16:17:40,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 117.45) internal successors, (4698), 40 states have internal predecessors, (4698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:40,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 399.0) internal successors, (16359), 41 states have internal predecessors, (16359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:40,614 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 399.0) internal successors, (16359), 41 states have internal predecessors, (16359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:40,614 INFO L175 Difference]: Start difference. First operand has 71 places, 98 transitions, 655 flow. Second operand 40 states and 4698 transitions. [2023-11-17 16:17:40,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 446 transitions, 3469 flow [2023-11-17 16:17:40,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 446 transitions, 3171 flow, removed 115 selfloop flow, removed 3 redundant places. [2023-11-17 16:17:40,635 INFO L231 Difference]: Finished difference. Result has 125 places, 301 transitions, 2502 flow [2023-11-17 16:17:40,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=2502, PETRI_PLACES=125, PETRI_TRANSITIONS=301} [2023-11-17 16:17:40,637 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 92 predicate places. [2023-11-17 16:17:40,637 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 301 transitions, 2502 flow [2023-11-17 16:17:40,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 112.48148148148148) internal successors, (3037), 27 states have internal predecessors, (3037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:40,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:17:40,640 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-11-17 16:17:40,649 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-11-17 16:17:40,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:17:40,848 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-11-17 16:17:40,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:17:40,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1392369270, now seen corresponding path program 3 times [2023-11-17 16:17:40,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:17:40,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574048533] [2023-11-17 16:17:40,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:17:40,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:17:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:17:41,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:17:41,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:17:41,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574048533] [2023-11-17 16:17:41,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574048533] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:17:41,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28968473] [2023-11-17 16:17:41,395 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:17:41,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:17:41,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:17:41,396 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-11-17 16:17:41,424 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-11-17 16:17:41,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 16:17:41,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:17:41,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-17 16:17:41,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:17:41,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:17:41,782 INFO L378 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-11-17 16:17:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:17:41,790 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:17:41,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:17:41,863 INFO L378 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-11-17 16:17:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:17:42,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28968473] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:17:42,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:17:42,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 24 [2023-11-17 16:17:42,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222488155] [2023-11-17 16:17:42,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:17:42,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-17 16:17:42,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:17:42,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-17 16:17:42,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=551, Unknown=0, NotChecked=0, Total=650 [2023-11-17 16:17:42,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 399 [2023-11-17 16:17:42,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 301 transitions, 2502 flow. Second operand has 26 states, 26 states have (on average 112.38461538461539) internal successors, (2922), 26 states have internal predecessors, (2922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:42,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:17:42,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 399 [2023-11-17 16:17:42,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:17:43,980 INFO L124 PetriNetUnfolderBase]: 4273/6174 cut-off events. [2023-11-17 16:17:43,980 INFO L125 PetriNetUnfolderBase]: For 24136/24136 co-relation queries the response was YES. [2023-11-17 16:17:44,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30233 conditions, 6174 events. 4273/6174 cut-off events. For 24136/24136 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 30255 event pairs, 602 based on Foata normal form. 1/6175 useless extension candidates. Maximal degree in co-relation 29978. Up to 4418 conditions per place. [2023-11-17 16:17:44,027 INFO L140 encePairwiseOnDemand]: 382/399 looper letters, 328 selfloop transitions, 353 changer transitions 1/682 dead transitions. [2023-11-17 16:17:44,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 682 transitions, 6809 flow [2023-11-17 16:17:44,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-17 16:17:44,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-11-17 16:17:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 4908 transitions. [2023-11-17 16:17:44,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.292875044754744 [2023-11-17 16:17:44,035 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 4908 transitions. [2023-11-17 16:17:44,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 4908 transitions. [2023-11-17 16:17:44,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:17:44,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 4908 transitions. [2023-11-17 16:17:44,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 116.85714285714286) internal successors, (4908), 42 states have internal predecessors, (4908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:44,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 399.0) internal successors, (17157), 43 states have internal predecessors, (17157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:44,059 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 399.0) internal successors, (17157), 43 states have internal predecessors, (17157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:44,059 INFO L175 Difference]: Start difference. First operand has 125 places, 301 transitions, 2502 flow. Second operand 42 states and 4908 transitions. [2023-11-17 16:17:44,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 682 transitions, 6809 flow [2023-11-17 16:17:44,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 682 transitions, 6126 flow, removed 249 selfloop flow, removed 4 redundant places. [2023-11-17 16:17:44,126 INFO L231 Difference]: Finished difference. Result has 180 places, 541 transitions, 5142 flow [2023-11-17 16:17:44,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=2197, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=134, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=5142, PETRI_PLACES=180, PETRI_TRANSITIONS=541} [2023-11-17 16:17:44,127 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 147 predicate places. [2023-11-17 16:17:44,127 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 541 transitions, 5142 flow [2023-11-17 16:17:44,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 112.38461538461539) internal successors, (2922), 26 states have internal predecessors, (2922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:44,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:17:44,128 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-11-17 16:17:44,136 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-11-17 16:17:44,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:17:44,333 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-11-17 16:17:44,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:17:44,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1370258562, now seen corresponding path program 4 times [2023-11-17 16:17:44,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:17:44,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947414211] [2023-11-17 16:17:44,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:17:44,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:17:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:17:45,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:17:45,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:17:45,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947414211] [2023-11-17 16:17:45,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947414211] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:17:45,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909260923] [2023-11-17 16:17:45,134 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:17:45,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:17:45,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:17:45,135 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-11-17 16:17:45,163 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-11-17 16:17:45,234 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:17:45,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:17:45,235 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-17 16:17:45,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:17:45,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:17:45,522 INFO L378 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-11-17 16:17:45,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:17:45,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:17:45,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:17:45,603 INFO L378 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-11-17 16:17:45,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:17:45,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909260923] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:17:45,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:17:45,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 29 [2023-11-17 16:17:45,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088456689] [2023-11-17 16:17:45,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:17:45,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-17 16:17:45,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:17:45,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-17 16:17:45,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2023-11-17 16:17:45,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 399 [2023-11-17 16:17:45,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 541 transitions, 5142 flow. Second operand has 31 states, 31 states have (on average 100.09677419354838) internal successors, (3103), 31 states have internal predecessors, (3103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:45,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:17:45,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 399 [2023-11-17 16:17:45,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:17:48,573 INFO L124 PetriNetUnfolderBase]: 5923/8541 cut-off events. [2023-11-17 16:17:48,573 INFO L125 PetriNetUnfolderBase]: For 35532/35532 co-relation queries the response was YES. [2023-11-17 16:17:48,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44107 conditions, 8541 events. 5923/8541 cut-off events. For 35532/35532 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 43218 event pairs, 582 based on Foata normal form. 75/8616 useless extension candidates. Maximal degree in co-relation 43866. Up to 4840 conditions per place. [2023-11-17 16:17:48,632 INFO L140 encePairwiseOnDemand]: 382/399 looper letters, 444 selfloop transitions, 616 changer transitions 11/1071 dead transitions. [2023-11-17 16:17:48,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 1071 transitions, 11283 flow [2023-11-17 16:17:48,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-17 16:17:48,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-11-17 16:17:48,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 5217 transitions. [2023-11-17 16:17:48,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26684057081479207 [2023-11-17 16:17:48,638 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 5217 transitions. [2023-11-17 16:17:48,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 5217 transitions. [2023-11-17 16:17:48,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:17:48,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 5217 transitions. [2023-11-17 16:17:48,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 106.46938775510205) internal successors, (5217), 49 states have internal predecessors, (5217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:48,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 399.0) internal successors, (19950), 50 states have internal predecessors, (19950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:48,658 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 399.0) internal successors, (19950), 50 states have internal predecessors, (19950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:48,658 INFO L175 Difference]: Start difference. First operand has 180 places, 541 transitions, 5142 flow. Second operand 49 states and 5217 transitions. [2023-11-17 16:17:48,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 1071 transitions, 11283 flow [2023-11-17 16:17:48,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 1071 transitions, 11168 flow, removed 47 selfloop flow, removed 5 redundant places. [2023-11-17 16:17:48,839 INFO L231 Difference]: Finished difference. Result has 251 places, 822 transitions, 9585 flow [2023-11-17 16:17:48,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=5071, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=353, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=9585, PETRI_PLACES=251, PETRI_TRANSITIONS=822} [2023-11-17 16:17:48,841 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 218 predicate places. [2023-11-17 16:17:48,841 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 822 transitions, 9585 flow [2023-11-17 16:17:48,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 100.09677419354838) internal successors, (3103), 31 states have internal predecessors, (3103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:48,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:17:48,842 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-11-17 16:17:48,850 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-11-17 16:17:49,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:17:49,051 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-11-17 16:17:49,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:17:49,052 INFO L85 PathProgramCache]: Analyzing trace with hash 416945734, now seen corresponding path program 5 times [2023-11-17 16:17:49,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:17:49,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898209658] [2023-11-17 16:17:49,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:17:49,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:17:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:17:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:17:49,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:17:49,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898209658] [2023-11-17 16:17:49,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898209658] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:17:49,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617864047] [2023-11-17 16:17:49,707 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:17:49,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:17:49,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:17:49,708 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-11-17 16:17:49,735 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-11-17 16:17:49,802 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:17:49,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:17:49,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-17 16:17:49,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:17:50,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:17:50,172 INFO L378 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-11-17 16:17:50,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:17:50,181 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:17:50,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:17:50,246 INFO L378 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-11-17 16:17:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:17:50,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617864047] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:17:50,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:17:50,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2023-11-17 16:17:50,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712567730] [2023-11-17 16:17:50,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:17:50,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-17 16:17:50,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:17:50,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-17 16:17:50,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=620, Unknown=0, NotChecked=0, Total=756 [2023-11-17 16:17:50,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 399 [2023-11-17 16:17:50,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 822 transitions, 9585 flow. Second operand has 28 states, 28 states have (on average 104.21428571428571) internal successors, (2918), 28 states have internal predecessors, (2918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:50,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:17:50,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 399 [2023-11-17 16:17:50,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:17:53,460 INFO L124 PetriNetUnfolderBase]: 8042/11544 cut-off events. [2023-11-17 16:17:53,461 INFO L125 PetriNetUnfolderBase]: For 112035/112035 co-relation queries the response was YES. [2023-11-17 16:17:53,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73933 conditions, 11544 events. 8042/11544 cut-off events. For 112035/112035 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 61598 event pairs, 1088 based on Foata normal form. 2/11546 useless extension candidates. Maximal degree in co-relation 73613. Up to 8351 conditions per place. [2023-11-17 16:17:53,645 INFO L140 encePairwiseOnDemand]: 386/399 looper letters, 775 selfloop transitions, 424 changer transitions 2/1201 dead transitions. [2023-11-17 16:17:53,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 1201 transitions, 16061 flow [2023-11-17 16:17:53,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-17 16:17:53,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-11-17 16:17:53,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2923 transitions. [2023-11-17 16:17:53,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2817620975515712 [2023-11-17 16:17:53,649 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2923 transitions. [2023-11-17 16:17:53,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2923 transitions. [2023-11-17 16:17:53,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:17:53,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2923 transitions. [2023-11-17 16:17:53,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 112.42307692307692) internal successors, (2923), 26 states have internal predecessors, (2923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:53,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 399.0) internal successors, (10773), 27 states have internal predecessors, (10773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:53,660 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 399.0) internal successors, (10773), 27 states have internal predecessors, (10773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:53,660 INFO L175 Difference]: Start difference. First operand has 251 places, 822 transitions, 9585 flow. Second operand 26 states and 2923 transitions. [2023-11-17 16:17:53,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 1201 transitions, 16061 flow [2023-11-17 16:17:54,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 1201 transitions, 15712 flow, removed 167 selfloop flow, removed 5 redundant places. [2023-11-17 16:17:54,152 INFO L231 Difference]: Finished difference. Result has 277 places, 1002 transitions, 12725 flow [2023-11-17 16:17:54,152 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=9268, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=822, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=288, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=12725, PETRI_PLACES=277, PETRI_TRANSITIONS=1002} [2023-11-17 16:17:54,153 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 244 predicate places. [2023-11-17 16:17:54,153 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 1002 transitions, 12725 flow [2023-11-17 16:17:54,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 104.21428571428571) internal successors, (2918), 28 states have internal predecessors, (2918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:54,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:17:54,153 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-11-17 16:17:54,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-17 16:17:54,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:17:54,358 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-11-17 16:17:54,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:17:54,358 INFO L85 PathProgramCache]: Analyzing trace with hash -169324822, now seen corresponding path program 6 times [2023-11-17 16:17:54,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:17:54,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109714533] [2023-11-17 16:17:54,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:17:54,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:17:54,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:17:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:17:54,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:17:54,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109714533] [2023-11-17 16:17:54,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109714533] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:17:54,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183313456] [2023-11-17 16:17:54,888 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 16:17:54,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:17:54,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:17:54,890 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-11-17 16:17:54,914 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-11-17 16:17:55,001 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-17 16:17:55,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:17:55,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-17 16:17:55,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:17:55,281 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-11-17 16:17:55,282 INFO L378 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 43 [2023-11-17 16:17:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:17:55,341 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:17:55,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:17:55,431 INFO L378 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-11-17 16:17:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:17:55,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183313456] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:17:55,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:17:55,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 24 [2023-11-17 16:17:55,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993598826] [2023-11-17 16:17:55,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:17:55,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-17 16:17:55,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:17:55,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-17 16:17:55,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2023-11-17 16:17:55,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 399 [2023-11-17 16:17:55,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 1002 transitions, 12725 flow. Second operand has 26 states, 26 states have (on average 116.53846153846153) internal successors, (3030), 26 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:55,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:17:55,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 399 [2023-11-17 16:17:55,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:17:59,024 INFO L124 PetriNetUnfolderBase]: 9344/13353 cut-off events. [2023-11-17 16:17:59,024 INFO L125 PetriNetUnfolderBase]: For 146806/146806 co-relation queries the response was YES. [2023-11-17 16:17:59,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90423 conditions, 13353 events. 9344/13353 cut-off events. For 146806/146806 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 72534 event pairs, 1242 based on Foata normal form. 1/13354 useless extension candidates. Maximal degree in co-relation 90092. Up to 10073 conditions per place. [2023-11-17 16:17:59,158 INFO L140 encePairwiseOnDemand]: 384/399 looper letters, 834 selfloop transitions, 601 changer transitions 1/1436 dead transitions. [2023-11-17 16:17:59,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 1436 transitions, 20723 flow [2023-11-17 16:17:59,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 16:17:59,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-17 16:17:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3560 transitions. [2023-11-17 16:17:59,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30766571601417336 [2023-11-17 16:17:59,162 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 3560 transitions. [2023-11-17 16:17:59,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 3560 transitions. [2023-11-17 16:17:59,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:17:59,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 3560 transitions. [2023-11-17 16:17:59,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 122.75862068965517) internal successors, (3560), 29 states have internal predecessors, (3560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:59,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 399.0) internal successors, (11970), 30 states have internal predecessors, (11970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:59,173 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 399.0) internal successors, (11970), 30 states have internal predecessors, (11970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:59,173 INFO L175 Difference]: Start difference. First operand has 277 places, 1002 transitions, 12725 flow. Second operand 29 states and 3560 transitions. [2023-11-17 16:17:59,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 1436 transitions, 20723 flow [2023-11-17 16:17:59,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 1436 transitions, 20222 flow, removed 109 selfloop flow, removed 10 redundant places. [2023-11-17 16:17:59,909 INFO L231 Difference]: Finished difference. Result has 305 places, 1261 transitions, 17674 flow [2023-11-17 16:17:59,910 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=12280, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1002, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=388, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=17674, PETRI_PLACES=305, PETRI_TRANSITIONS=1261} [2023-11-17 16:17:59,910 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 272 predicate places. [2023-11-17 16:17:59,910 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 1261 transitions, 17674 flow [2023-11-17 16:17:59,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 116.53846153846153) internal successors, (3030), 26 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:17:59,911 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:17:59,911 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-11-17 16:17:59,917 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-11-17 16:18:00,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:18:00,118 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-11-17 16:18:00,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:18:00,118 INFO L85 PathProgramCache]: Analyzing trace with hash 648224000, now seen corresponding path program 7 times [2023-11-17 16:18:00,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:18:00,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504178362] [2023-11-17 16:18:00,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:18:00,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:18:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:18:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:18:00,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:18:00,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504178362] [2023-11-17 16:18:00,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504178362] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:18:00,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113368997] [2023-11-17 16:18:00,969 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 16:18:00,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:18:00,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:18:00,970 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-11-17 16:18:00,972 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-11-17 16:18:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:18:01,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-17 16:18:01,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:18:01,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:18:01,305 INFO L378 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-11-17 16:18:01,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:18:01,315 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:18:01,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:18:01,371 INFO L378 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-11-17 16:18:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:18:01,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113368997] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:18:01,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:18:01,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2023-11-17 16:18:01,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843319415] [2023-11-17 16:18:01,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:18:01,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-17 16:18:01,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:18:01,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-17 16:18:01,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2023-11-17 16:18:01,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 399 [2023-11-17 16:18:01,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 1261 transitions, 17674 flow. Second operand has 28 states, 28 states have (on average 101.14285714285714) internal successors, (2832), 28 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:18:01,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:18:01,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 399 [2023-11-17 16:18:01,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:18:05,852 INFO L124 PetriNetUnfolderBase]: 10605/15107 cut-off events. [2023-11-17 16:18:05,852 INFO L125 PetriNetUnfolderBase]: For 188503/188503 co-relation queries the response was YES. [2023-11-17 16:18:05,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108145 conditions, 15107 events. 10605/15107 cut-off events. For 188503/188503 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 83361 event pairs, 1600 based on Foata normal form. 1/15108 useless extension candidates. Maximal degree in co-relation 107797. Up to 12256 conditions per place. [2023-11-17 16:18:06,112 INFO L140 encePairwiseOnDemand]: 386/399 looper letters, 1049 selfloop transitions, 499 changer transitions 1/1549 dead transitions. [2023-11-17 16:18:06,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 1549 transitions, 24029 flow [2023-11-17 16:18:06,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-17 16:18:06,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-11-17 16:18:06,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2785 transitions. [2023-11-17 16:18:06,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2684596105648737 [2023-11-17 16:18:06,116 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2785 transitions. [2023-11-17 16:18:06,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2785 transitions. [2023-11-17 16:18:06,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:18:06,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2785 transitions. [2023-11-17 16:18:06,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 107.11538461538461) internal successors, (2785), 26 states have internal predecessors, (2785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:18:06,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 399.0) internal successors, (10773), 27 states have internal predecessors, (10773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:18:06,125 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 399.0) internal successors, (10773), 27 states have internal predecessors, (10773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:18:06,125 INFO L175 Difference]: Start difference. First operand has 305 places, 1261 transitions, 17674 flow. Second operand 26 states and 2785 transitions. [2023-11-17 16:18:06,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 1549 transitions, 24029 flow [2023-11-17 16:18:07,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 1549 transitions, 23097 flow, removed 321 selfloop flow, removed 11 redundant places. [2023-11-17 16:18:07,324 INFO L231 Difference]: Finished difference. Result has 329 places, 1391 transitions, 20204 flow [2023-11-17 16:18:07,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=16766, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=384, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=788, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=20204, PETRI_PLACES=329, PETRI_TRANSITIONS=1391} [2023-11-17 16:18:07,325 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 296 predicate places. [2023-11-17 16:18:07,325 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 1391 transitions, 20204 flow [2023-11-17 16:18:07,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 101.14285714285714) internal successors, (2832), 28 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:18:07,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:18:07,326 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-11-17 16:18:07,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-17 16:18:07,531 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,SelfDestructingSolverStorable10 [2023-11-17 16:18:07,531 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-11-17 16:18:07,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:18:07,531 INFO L85 PathProgramCache]: Analyzing trace with hash -149258858, now seen corresponding path program 8 times [2023-11-17 16:18:07,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:18:07,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896196812] [2023-11-17 16:18:07,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:18:07,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:18:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:18:08,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:18:08,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:18:08,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896196812] [2023-11-17 16:18:08,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896196812] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:18:08,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457379481] [2023-11-17 16:18:08,328 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:18:08,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:18:08,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:18:08,329 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-11-17 16:18:08,332 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-11-17 16:18:08,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:18:08,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:18:08,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-17 16:18:08,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:18:08,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 16:18:08,625 INFO L378 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 8 treesize of output 1 [2023-11-17 16:18:08,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:18:08,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:18:08,821 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 16:18:08,821 INFO L378 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 22 treesize of output 20 [2023-11-17 16:18:08,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:18:08,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:18:08,868 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 16:18:08,869 INFO L378 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 22 treesize of output 20 [2023-11-17 16:18:09,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:18:09,008 INFO L378 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-11-17 16:18:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:18:09,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:18:11,333 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_419 (Array Int Int)) (v_ArrVal_421 (Array Int Int)) (v_ArrVal_420 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_419))) (= (+ c_~res1~0 (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|) (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (let ((.cse1 (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_420) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_421))) (+ c_~res2~0 (select (select .cse1 c_~A~0.base) c_~A~0.offset) (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) is different from false [2023-11-17 16:18:11,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:18:11,341 INFO L378 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 97 treesize of output 62 [2023-11-17 16:18:11,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:18:11,375 INFO L378 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 14054 treesize of output 12017 [2023-11-17 16:18:11,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:18:11,447 INFO L378 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 1422 treesize of output 1302 [2023-11-17 16:18:11,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:18:11,487 INFO L378 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 1294 treesize of output 1238 [2023-11-17 16:18:11,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:18:11,510 INFO L378 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 1230 treesize of output 1142 [2023-11-17 16:18:12,023 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:12,119 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:12,164 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:12,187 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:12,253 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:12,301 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:12,493 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:12,522 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:12,556 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:12,577 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:12,627 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:12,653 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:12,685 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:12,724 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:12,769 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:12,826 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:12,853 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:12,894 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:12,991 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:13,029 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:13,066 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:13,125 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:13,158 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:13,183 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:13,233 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:13,412 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:13,434 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:13,457 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:13,481 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:13,513 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:13,580 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:13,600 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:13,636 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:13,677 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:13,715 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:13,719 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:13,766 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:13,786 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:13,840 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:13,879 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:13,912 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:13,925 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:13,978 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:14,024 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:14,079 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:14,125 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:14,164 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:14,279 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:14,326 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:14,363 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:14,404 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:14,437 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:14,454 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:14,683 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:14,714 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:14,718 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:14,721 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:14,748 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:14,764 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:14,800 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:14,845 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:14,849 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:14,872 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:14,878 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:14,914 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:14,944 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:14,955 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:14,982 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:14,988 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:15,075 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:15,079 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:15,112 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:15,137 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:15,174 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:15,200 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:15,240 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:15,262 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:15,321 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:15,375 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:15,384 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:15,398 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:15,441 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:15,491 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:15,560 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:15,700 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:15,751 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:15,766 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:15,818 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:15,823 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:15,840 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:15,908 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:15,971 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:16,023 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:16,150 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:16,154 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:16,199 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:16,216 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:16,247 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:16,267 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:16,271 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:16,275 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:16,313 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:16,316 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:16,425 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:16,466 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:16,533 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:16,581 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:16,638 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:16,709 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:16,762 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:16,805 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:16,857 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:16,949 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:17,008 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:17,296 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:17,324 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:17,339 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:17,343 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:17,374 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:17,396 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:17,403 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:17,452 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:17,476 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:17,510 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:17,534 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:17,540 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:17,568 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:17,571 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:17,598 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:17,602 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:17,669 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:17,711 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:17,740 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:17,795 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:17,831 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:17,842 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:17,877 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:17,896 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:17,932 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:17,938 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:18,002 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:18,032 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:18,053 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:18,090 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:18,127 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:18,133 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:18,193 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:18,309 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:18,335 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:18,367 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:18,402 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:18,431 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:18,451 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:18,503 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:18,506 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:18,530 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:18,541 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:18,586 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:18,611 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:18,614 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:18,654 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:18,955 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:19,380 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:19,436 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:19,464 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:19,500 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:19,547 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:20,757 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:20,782 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:20,793 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:20,827 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:20,833 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:20,862 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:20,876 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:20,895 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:20,929 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:20,973 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:21,242 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:21,269 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:22,195 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:22,241 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:22,287 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:22,327 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:22,375 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:22,380 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:22,486 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:22,535 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:22,566 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:22,609 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:22,628 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:22,666 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:22,700 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:22,813 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:22,994 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:23,032 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:23,071 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:23,116 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:23,165 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:23,219 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:23,231 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:23,260 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:23,308 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:23,354 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:23,367 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:23,400 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:23,465 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:23,498 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:23,546 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:23,604 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:23,662 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:23,666 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:23,726 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:23,782 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:23,786 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:23,795 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:23,798 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:23,828 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:23,837 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:23,844 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:23,848 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:23,852 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:23,888 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:23,978 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:24,007 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:24,056 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:24,060 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:24,125 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:24,136 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:24,179 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:24,184 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:24,216 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:24,241 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:24,246 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:24,305 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:24,317 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:24,366 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:24,370 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:24,396 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:24,423 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:24,429 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:24,432 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:24,471 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:24,476 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:24,493 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:24,498 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:24,538 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:24,542 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:24,588 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:24,592 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:24,622 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:24,626 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:24,680 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:24,724 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:24,743 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:24,776 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:24,807 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:24,871 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:24,954 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:24,966 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:24,997 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:25,039 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:25,088 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:25,128 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:25,164 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:25,221 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:25,261 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:25,344 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:25,399 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:25,495 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:25,501 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:25,559 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:25,650 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:25,688 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:25,721 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:25,725 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:25,728 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:25,805 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:25,836 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:25,839 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:25,847 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:25,879 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:25,894 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:25,897 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:25,900 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:25,905 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:25,922 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:25,953 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:25,956 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:25,985 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:26,596 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:26,630 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:26,664 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:26,678 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:26,721 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:26,725 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:26,741 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:26,772 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:26,807 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:26,857 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:26,901 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:26,951 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:26,988 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:27,032 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:27,038 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:27,097 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:27,133 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:27,184 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:27,210 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:27,214 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:27,217 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:27,450 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:27,490 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:27,532 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:27,593 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:27,658 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:27,721 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:27,782 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:27,794 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:27,798 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:27,967 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:27,973 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:27,977 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:28,019 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:28,031 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:28,036 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:28,041 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:28,045 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:28,086 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:28,141 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:28,167 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:28,226 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:28,243 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:28,248 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:28,295 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:28,318 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:28,323 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:28,339 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:28,358 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:28,391 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:28,435 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:28,489 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:28,510 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:28,526 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:28,531 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:28,578 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:28,606 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:28,611 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:28,626 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:28,645 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:28,687 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:28,699 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:28,732 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:28,783 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:28,799 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:28,841 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:28,852 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:28,855 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:28,913 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:28,917 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:28,921 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:28,966 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:28,971 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:29,004 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:29,018 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:29,023 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:29,034 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:29,076 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:29,081 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:29,084 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:29,089 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:29,092 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:29,156 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:29,171 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:29,188 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:29,216 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:29,246 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:29,250 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:29,293 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:29,348 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:29,364 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:29,409 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:29,452 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:29,484 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:29,528 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:29,573 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:29,611 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:29,732 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:29,771 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:29,813 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:29,872 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:29,911 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:29,938 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:29,980 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:30,027 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:30,067 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:30,081 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:30,094 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:30,120 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:30,126 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:30,130 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:30,172 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:30,217 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:30,268 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:30,326 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:30,421 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:30,450 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:30,485 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:30,491 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:30,521 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:30,525 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:30,531 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:30,555 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:30,594 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:30,603 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:30,639 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:30,702 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:30,731 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:30,735 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:30,743 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:30,750 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:30,755 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:30,790 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:30,794 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:30,797 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:30,806 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:30,812 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:30,815 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:30,818 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:30,823 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:30,828 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:31,465 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:31,554 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:31,601 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:31,748 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:31,857 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:31,881 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:32,174 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:32,394 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:32,414 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:32,419 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:32,462 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:32,470 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:32,554 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:32,560 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:32,608 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:32,612 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:32,692 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:32,701 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:32,945 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:33,015 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:33,078 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:33,154 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:33,206 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:33,314 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:33,326 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:33,374 WARN L667 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2023-11-17 16:18:33,439 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:33,455 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:33,537 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:33,574 WARN L667 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2023-11-17 16:18:33,638 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:33,644 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:33,670 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:33,676 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:33,736 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:33,763 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:33,778 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:33,801 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:33,813 WARN L667 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2023-11-17 16:18:33,875 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:33,881 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:33,927 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:33,937 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:33,942 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:34,000 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:34,005 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:34,020 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:34,073 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:34,078 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:34,097 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:34,129 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:34,219 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:34,254 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:34,309 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:34,361 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:34,365 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:34,419 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:34,425 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:34,430 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:34,453 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:34,499 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:34,507 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:34,512 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:34,545 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:34,570 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:34,618 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:34,754 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:34,759 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:34,871 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:34,916 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:34,993 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:35,100 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:35,166 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:35,229 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:35,280 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:35,338 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:35,407 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:35,515 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:35,563 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:35,912 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:35,953 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:36,024 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:36,074 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:36,276 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:36,356 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:36,431 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:36,512 WARN L667 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2023-11-17 16:18:36,657 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:36,729 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:36,789 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:36,844 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:37,012 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:37,023 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:37,051 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:37,127 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:37,148 WARN L667 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2023-11-17 16:18:37,211 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:37,227 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:37,232 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:37,292 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:37,319 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:37,335 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:37,389 WARN L667 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2023-11-17 16:18:37,455 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:37,461 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:37,484 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:37,500 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:37,546 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:37,555 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:37,559 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:37,618 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:37,623 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:37,638 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:37,691 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:37,696 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:37,701 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:37,731 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:37,806 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:37,832 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:37,836 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:37,888 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:37,990 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:38,042 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:38,058 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:38,119 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:38,124 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:38,234 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:38,281 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:38,306 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:38,359 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:38,471 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:38,539 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:38,609 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:38,665 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:38,716 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:38,805 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:38,903 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:38,973 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:39,040 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:39,094 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:39,187 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:39,222 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:39,233 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:39,247 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:39,268 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:39,313 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:39,318 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:39,322 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:39,328 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:39,368 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:39,413 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:39,427 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:39,450 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:39,455 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:39,459 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:39,503 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:39,509 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:39,536 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:39,579 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:39,595 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:39,646 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:39,652 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:39,702 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:39,707 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:39,752 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:40,595 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:40,652 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:40,760 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:40,849 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:40,895 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:40,992 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:41,049 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:41,142 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:41,146 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:41,262 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:41,409 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:41,456 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:41,460 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:41,508 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:41,513 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:41,531 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:41,580 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:41,584 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:41,635 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:41,640 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:41,717 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:41,723 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:41,780 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:41,818 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:41,823 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:41,924 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:41,968 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:41,974 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:42,031 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:42,052 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:42,057 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:42,123 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:42,168 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:42,271 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:42,362 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:42,408 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:42,454 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:42,477 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:42,521 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:42,526 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:42,530 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:42,536 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:42,541 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:42,599 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:42,644 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:42,649 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:42,691 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:42,696 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:42,784 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:42,795 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:42,837 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:42,843 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:42,847 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:42,851 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:42,892 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:42,902 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:42,926 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:42,966 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:42,970 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:42,974 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:42,983 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:43,020 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:43,051 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:43,081 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:43,458 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:43,490 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:43,537 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:43,597 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:43,642 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:43,719 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:43,764 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:43,826 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:43,883 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:43,947 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:43,997 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:44,076 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:44,148 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:44,215 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:44,278 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:44,501 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:44,599 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:44,603 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:44,646 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:44,650 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:44,670 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:44,740 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:44,744 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:44,792 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:44,798 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:44,802 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:44,807 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:44,853 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:44,878 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:45,042 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:45,050 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:45,054 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:45,062 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:45,066 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:45,124 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:45,137 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:45,142 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:45,194 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:45,224 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:45,236 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:45,256 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:45,312 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:45,335 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:45,394 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:45,419 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:45,494 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:45,618 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:45,632 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:45,678 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:45,717 WARN L667 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2023-11-17 16:18:45,796 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:45,886 WARN L667 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2023-11-17 16:18:45,958 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:45,978 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:46,058 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:46,113 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:46,200 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:46,266 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:46,332 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:46,417 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:46,499 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:46,579 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:18:46,784 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:46,929 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:46,933 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:46,977 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:46,982 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:47,066 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:47,074 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:18:47,141 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:47,146 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:47,221 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:47,286 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:47,356 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:47,394 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:47,459 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:47,507 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:47,563 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:47,574 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:47,579 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:47,618 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:47,623 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:47,738 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:47,782 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:47,794 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:47,832 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:47,837 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:47,864 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:47,908 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:47,938 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:47,980 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:47,985 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:47,992 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:48,034 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:48,079 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:48,116 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:48,121 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:48,426 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:48,446 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:48,625 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:48,655 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:48,659 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:48,690 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:48,695 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:48,742 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:48,759 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:48,797 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:48,807 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:48,842 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:48,846 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:48,852 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:48,928 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:48,959 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:48,981 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:49,026 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:49,061 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:49,154 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:49,203 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:49,220 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:49,279 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:49,345 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:49,382 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:49,427 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:49,506 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:49,541 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:49,550 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:49,591 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:49,598 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:49,666 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:49,724 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:49,729 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:49,804 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:49,865 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:49,870 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:49,942 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:49,984 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:50,017 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:50,035 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:50,092 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:50,147 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:50,202 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:50,277 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:50,286 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:50,448 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:50,458 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:50,481 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:50,524 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:50,564 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:50,571 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:50,610 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:50,620 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:50,630 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:50,649 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:50,655 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:50,660 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:50,673 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:50,712 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:50,746 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:50,756 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:50,760 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:50,798 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:50,858 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:50,877 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:50,964 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:51,025 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:51,096 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:51,165 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:51,222 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:51,280 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:51,452 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:51,504 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:51,534 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:51,546 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:51,551 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:51,624 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:51,676 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:51,690 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:51,755 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:51,788 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:51,793 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:51,798 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:18:51,853 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:51,871 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:51,912 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:51,916 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:51,957 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:51,972 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:51,981 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:51,985 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:52,031 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:52,098 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:52,151 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:52,193 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:52,268 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:18:52,327 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:18:52,385 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:54,948 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:55,091 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:55,168 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:55,299 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:55,511 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:58,223 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:58,254 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:58,304 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:58,378 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:58,392 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:58,425 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:58,456 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:58,491 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:58,538 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:58,564 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:58,588 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:58,630 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:58,664 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:58,706 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:58,791 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:59,002 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:59,038 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:59,067 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:59,077 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:59,169 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:59,205 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:59,215 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:59,277 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:59,312 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:59,387 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:59,425 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:18:59,493 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:59,512 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:59,552 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:59,583 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:59,649 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:18:59,698 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:18:59,836 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:18:59,849 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:00,102 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:00,243 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:00,277 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:00,424 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:00,453 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:00,481 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:00,522 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:00,557 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:01,610 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:01,615 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:01,995 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:02,049 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:02,067 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:02,332 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:02,342 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:02,519 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:02,537 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:02,554 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:02,610 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:02,972 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:03,089 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:06,343 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:06,343 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:19:06,378 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:06,456 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:06,482 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:06,499 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:06,560 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:06,567 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:06,574 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:06,575 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:06,580 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:06,602 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:06,611 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:06,651 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:08,277 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:19:08,278 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:19:08,324 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:08,442 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:19:08,764 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:08,883 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:19:08,884 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:19:08,928 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:08,977 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:09,107 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:09,107 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:09,109 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:09,114 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:19:09,114 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:19:09,119 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:09,120 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:19:09,124 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:09,125 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:19:09,183 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:09,232 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:09,258 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:19:09,258 WARN L667 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2023-11-17 16:19:09,261 WARN L667 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2023-11-17 16:19:09,266 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:09,266 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:19:09,270 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:09,280 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:09,280 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:19:09,284 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:09,284 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:19:09,286 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:19:09,292 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:09,342 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:09,343 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:19:09,345 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:19:09,351 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:09,375 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:09,424 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:09,541 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:09,542 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:19:09,573 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:09,690 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:19:09,690 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:19:09,704 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:09,821 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:19:10,345 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:10,461 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:19:10,796 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:10,919 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:19:12,121 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:19:12,121 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:19:12,383 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:19:12,384 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:19:13,036 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:13,037 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:19:13,041 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:13,051 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:13,076 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:13,077 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:19:13,079 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:19:13,084 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:13,084 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:13,085 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:13,099 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:13,110 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:13,130 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:13,177 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:13,198 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:13,207 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:13,213 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:13,213 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:19:13,216 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:19:13,221 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:13,227 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:13,233 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:19:13,233 WARN L667 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2023-11-17 16:19:13,235 WARN L667 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2023-11-17 16:19:13,245 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:13,246 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:19:13,248 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:19:13,256 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:13,256 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:19:13,258 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:19:13,267 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:13,267 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:19:13,273 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:13,293 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:13,341 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:13,342 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:19:13,346 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:13,347 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:19:13,350 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:13,351 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:19:13,354 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:13,375 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:13,375 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:19:13,379 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:13,388 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:13,389 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:19:13,390 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:19:13,398 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:19:13,399 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:19:13,401 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:19:13,410 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:13,431 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:13,462 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:13,510 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:13,528 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:13,528 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:19:13,531 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:19:13,640 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:13,647 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:13,647 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:19:13,710 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:13,710 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:13,715 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:13,730 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:13,736 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:13,736 WARN L667 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2023-11-17 16:19:13,745 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:13,745 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-17 16:19:13,754 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:13,755 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:19:13,763 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:13,763 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:19:13,769 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:13,790 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:13,790 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:19:13,802 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:13,808 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:13,818 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:13,824 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:13,824 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:19:13,829 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:13,829 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:19:13,837 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:13,859 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:13,864 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:13,870 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:13,884 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:13,890 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:13,891 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:19:13,896 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-17 16:19:13,896 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-11-17 16:19:13,901 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:13,907 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:13,923 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:13,923 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:19:13,928 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:13,929 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-17 16:19:13,933 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:13,944 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-17 16:19:13,944 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:19:13,949 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:13,973 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:13,984 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:13,984 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-17 16:19:13,990 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:14,012 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:14,226 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:14,241 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:14,246 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:14,246 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:14,266 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:14,266 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:14,279 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:14,279 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:14,289 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:14,294 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:14,300 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:14,300 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:14,319 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:14,319 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-17 16:19:14,341 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:14,342 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:14,355 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:14,369 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:14,373 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:14,374 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:14,445 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:14,456 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:16,357 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:16,365 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:16,483 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:16,501 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:16,558 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:16,562 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:16,566 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:16,570 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:16,801 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:16,805 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:16,923 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:16,942 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:17,001 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:17,006 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-17 16:19:17,010 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:17,016 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-17 16:19:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-17 16:19:17,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457379481] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:19:17,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:19:17,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 35 [2023-11-17 16:19:17,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558717510] [2023-11-17 16:19:17,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:19:17,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-17 16:19:17,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:19:17,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-17 16:19:17,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1125, Unknown=10, NotChecked=68, Total=1332 [2023-11-17 16:19:17,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 399 [2023-11-17 16:19:17,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 1391 transitions, 20204 flow. Second operand has 37 states, 37 states have (on average 105.78378378378379) internal successors, (3914), 37 states have internal predecessors, (3914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:19:17,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:19:17,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 399 [2023-11-17 16:19:17,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:19:24,426 INFO L124 PetriNetUnfolderBase]: 12619/18081 cut-off events. [2023-11-17 16:19:24,426 INFO L125 PetriNetUnfolderBase]: For 220418/220418 co-relation queries the response was YES. [2023-11-17 16:19:24,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132157 conditions, 18081 events. 12619/18081 cut-off events. For 220418/220418 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 104845 event pairs, 514 based on Foata normal form. 3/18084 useless extension candidates. Maximal degree in co-relation 131804. Up to 11305 conditions per place. [2023-11-17 16:19:24,763 INFO L140 encePairwiseOnDemand]: 381/399 looper letters, 844 selfloop transitions, 1124 changer transitions 3/1971 dead transitions. [2023-11-17 16:19:24,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 1971 transitions, 31410 flow [2023-11-17 16:19:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-17 16:19:24,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-11-17 16:19:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 3728 transitions. [2023-11-17 16:19:24,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2831320726057568 [2023-11-17 16:19:24,768 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 3728 transitions. [2023-11-17 16:19:24,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 3728 transitions. [2023-11-17 16:19:24,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:19:24,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 3728 transitions. [2023-11-17 16:19:24,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 112.96969696969697) internal successors, (3728), 33 states have internal predecessors, (3728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:19:24,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 399.0) internal successors, (13566), 34 states have internal predecessors, (13566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:19:24,783 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 399.0) internal successors, (13566), 34 states have internal predecessors, (13566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:19:24,783 INFO L175 Difference]: Start difference. First operand has 329 places, 1391 transitions, 20204 flow. Second operand 33 states and 3728 transitions. [2023-11-17 16:19:24,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 1971 transitions, 31410 flow [2023-11-17 16:19:26,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 1971 transitions, 31132 flow, removed 53 selfloop flow, removed 12 redundant places. [2023-11-17 16:19:26,239 INFO L231 Difference]: Finished difference. Result has 368 places, 1780 transitions, 29137 flow [2023-11-17 16:19:26,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=19965, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=766, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=29137, PETRI_PLACES=368, PETRI_TRANSITIONS=1780} [2023-11-17 16:19:26,240 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 335 predicate places. [2023-11-17 16:19:26,240 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 1780 transitions, 29137 flow [2023-11-17 16:19:26,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 105.78378378378379) internal successors, (3914), 37 states have internal predecessors, (3914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:19:26,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:19:26,241 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-11-17 16:19:26,246 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-11-17 16:19:26,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:19:26,445 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-11-17 16:19:26,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:19:26,445 INFO L85 PathProgramCache]: Analyzing trace with hash 937717990, now seen corresponding path program 9 times [2023-11-17 16:19:26,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:19:26,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100673217] [2023-11-17 16:19:26,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:19:26,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:19:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:19:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:19:27,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:19:27,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100673217] [2023-11-17 16:19:27,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100673217] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:19:27,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314012070] [2023-11-17 16:19:27,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:19:27,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:19:27,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:19:27,206 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-11-17 16:19:27,209 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-11-17 16:19:27,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 16:19:27,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:19:27,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-17 16:19:27,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:19:27,314 INFO L378 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-11-17 16:19:27,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:19:27,638 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 16:19:27,638 INFO L378 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 22 treesize of output 20 [2023-11-17 16:19:27,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:19:27,712 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 16:19:27,712 INFO L378 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 22 treesize of output 20 [2023-11-17 16:19:27,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:19:27,829 INFO L378 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 81 [2023-11-17 16:19:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:19:27,925 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:19:28,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:19:28,280 INFO L378 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 1526 treesize of output 962 [2023-11-17 16:19:28,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:19:28,300 INFO L378 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 438 treesize of output 398 [2023-11-17 16:19:28,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:19:28,319 INFO L378 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 390 treesize of output 302 [2023-11-17 16:19:29,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:19:29,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314012070] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:19:29,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:19:29,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2023-11-17 16:19:29,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210252997] [2023-11-17 16:19:29,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:19:29,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-17 16:19:29,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:19:29,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-17 16:19:29,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1142, Unknown=3, NotChecked=0, Total=1260 [2023-11-17 16:19:29,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 399 [2023-11-17 16:19:29,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 1780 transitions, 29137 flow. Second operand has 36 states, 36 states have (on average 103.94444444444444) internal successors, (3742), 36 states have internal predecessors, (3742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:19:29,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:19:29,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 399 [2023-11-17 16:19:29,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:19:39,281 INFO L124 PetriNetUnfolderBase]: 15545/22277 cut-off events. [2023-11-17 16:19:39,281 INFO L125 PetriNetUnfolderBase]: For 398909/398909 co-relation queries the response was YES. [2023-11-17 16:19:39,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188315 conditions, 22277 events. 15545/22277 cut-off events. For 398909/398909 co-relation queries the response was YES. Maximal size of possible extension queue 982. Compared 132397 event pairs, 561 based on Foata normal form. 2/22279 useless extension candidates. Maximal degree in co-relation 187925. Up to 11137 conditions per place. [2023-11-17 16:19:39,628 INFO L140 encePairwiseOnDemand]: 385/399 looper letters, 1187 selfloop transitions, 1504 changer transitions 9/2700 dead transitions. [2023-11-17 16:19:39,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 2700 transitions, 49739 flow [2023-11-17 16:19:39,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-17 16:19:39,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-11-17 16:19:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 5148 transitions. [2023-11-17 16:19:39,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2804838182412553 [2023-11-17 16:19:39,633 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 5148 transitions. [2023-11-17 16:19:39,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 5148 transitions. [2023-11-17 16:19:39,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:19:39,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 5148 transitions. [2023-11-17 16:19:39,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 111.91304347826087) internal successors, (5148), 46 states have internal predecessors, (5148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:19:39,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 399.0) internal successors, (18753), 47 states have internal predecessors, (18753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:19:39,648 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 399.0) internal successors, (18753), 47 states have internal predecessors, (18753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:19:39,649 INFO L175 Difference]: Start difference. First operand has 368 places, 1780 transitions, 29137 flow. Second operand 46 states and 5148 transitions. [2023-11-17 16:19:39,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 2700 transitions, 49739 flow [2023-11-17 16:19:43,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 2700 transitions, 45951 flow, removed 1840 selfloop flow, removed 6 redundant places. [2023-11-17 16:19:43,967 INFO L231 Difference]: Finished difference. Result has 418 places, 2286 transitions, 41529 flow [2023-11-17 16:19:43,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=27803, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1780, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1037, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=41529, PETRI_PLACES=418, PETRI_TRANSITIONS=2286} [2023-11-17 16:19:43,968 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 385 predicate places. [2023-11-17 16:19:43,968 INFO L495 AbstractCegarLoop]: Abstraction has has 418 places, 2286 transitions, 41529 flow [2023-11-17 16:19:43,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 103.94444444444444) internal successors, (3742), 36 states have internal predecessors, (3742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:19:43,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:19:43,969 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-11-17 16:19:43,974 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-11-17 16:19:44,174 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,SelfDestructingSolverStorable12 [2023-11-17 16:19:44,174 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-11-17 16:19:44,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:19:44,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1672197022, now seen corresponding path program 10 times [2023-11-17 16:19:44,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:19:44,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913497652] [2023-11-17 16:19:44,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:19:44,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:19:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:19:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:19:44,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:19:44,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913497652] [2023-11-17 16:19:44,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913497652] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:19:44,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825310716] [2023-11-17 16:19:44,843 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:19:44,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:19:44,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:19:44,844 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-11-17 16:19:44,845 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-11-17 16:19:44,938 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:19:44,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:19:44,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-17 16:19:44,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:19:45,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:19:45,204 INFO L378 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-11-17 16:19:45,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:19:45,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:19:45,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:19:45,313 INFO L378 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-11-17 16:19:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:19:45,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825310716] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:19:45,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:19:45,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 29 [2023-11-17 16:19:45,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456916135] [2023-11-17 16:19:45,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:19:45,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-17 16:19:45,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:19:45,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-17 16:19:45,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2023-11-17 16:19:45,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 399 [2023-11-17 16:19:45,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 2286 transitions, 41529 flow. Second operand has 31 states, 31 states have (on average 100.09677419354838) internal successors, (3103), 31 states have internal predecessors, (3103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:19:45,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:19:45,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 399 [2023-11-17 16:19:45,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:19:57,902 INFO L124 PetriNetUnfolderBase]: 20532/29381 cut-off events. [2023-11-17 16:19:57,903 INFO L125 PetriNetUnfolderBase]: For 540668/540668 co-relation queries the response was YES. [2023-11-17 16:19:58,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252560 conditions, 29381 events. 20532/29381 cut-off events. For 540668/540668 co-relation queries the response was YES. Maximal size of possible extension queue 1235. Compared 179437 event pairs, 1735 based on Foata normal form. 4/29385 useless extension candidates. Maximal degree in co-relation 252095. Up to 17687 conditions per place. [2023-11-17 16:19:58,345 INFO L140 encePairwiseOnDemand]: 383/399 looper letters, 1289 selfloop transitions, 2102 changer transitions 11/3402 dead transitions. [2023-11-17 16:19:58,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 3402 transitions, 65234 flow [2023-11-17 16:19:58,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-11-17 16:19:58,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-11-17 16:19:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 5711 transitions. [2023-11-17 16:19:58,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26506080014851946 [2023-11-17 16:19:58,350 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 5711 transitions. [2023-11-17 16:19:58,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 5711 transitions. [2023-11-17 16:19:58,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:19:58,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 5711 transitions. [2023-11-17 16:19:58,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 105.75925925925925) internal successors, (5711), 54 states have internal predecessors, (5711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:19:58,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 399.0) internal successors, (21945), 55 states have internal predecessors, (21945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:19:58,369 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 399.0) internal successors, (21945), 55 states have internal predecessors, (21945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:19:58,369 INFO L175 Difference]: Start difference. First operand has 418 places, 2286 transitions, 41529 flow. Second operand 54 states and 5711 transitions. [2023-11-17 16:19:58,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 3402 transitions, 65234 flow [2023-11-17 16:20:05,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 3402 transitions, 62487 flow, removed 1062 selfloop flow, removed 19 redundant places. [2023-11-17 16:20:05,840 INFO L231 Difference]: Finished difference. Result has 472 places, 3132 transitions, 58861 flow [2023-11-17 16:20:05,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=39139, PETRI_DIFFERENCE_MINUEND_PLACES=399, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1385, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=837, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=58861, PETRI_PLACES=472, PETRI_TRANSITIONS=3132} [2023-11-17 16:20:05,842 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 439 predicate places. [2023-11-17 16:20:05,842 INFO L495 AbstractCegarLoop]: Abstraction has has 472 places, 3132 transitions, 58861 flow [2023-11-17 16:20:05,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 100.09677419354838) internal successors, (3103), 31 states have internal predecessors, (3103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:05,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:20:05,843 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-11-17 16:20:05,849 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-11-17 16:20:06,047 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,SelfDestructingSolverStorable13 [2023-11-17 16:20:06,047 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-11-17 16:20:06,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:20:06,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1678911618, now seen corresponding path program 11 times [2023-11-17 16:20:06,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:20:06,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318322568] [2023-11-17 16:20:06,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:06,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:20:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:20:06,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:20:06,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318322568] [2023-11-17 16:20:06,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318322568] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:20:06,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734504454] [2023-11-17 16:20:06,693 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:20:06,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:20:06,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:20:06,694 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-11-17 16:20:06,695 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-11-17 16:20:06,795 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:20:06,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:20:06,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-17 16:20:06,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:20:07,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:20:07,058 INFO L378 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-11-17 16:20:07,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:20:07,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:20:07,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:20:07,153 INFO L378 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-11-17 16:20:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:20:07,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734504454] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:20:07,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:20:07,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 28 [2023-11-17 16:20:07,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336126243] [2023-11-17 16:20:07,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:20:07,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-17 16:20:07,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:20:07,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-17 16:20:07,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2023-11-17 16:20:07,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 399 [2023-11-17 16:20:07,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 3132 transitions, 58861 flow. Second operand has 30 states, 30 states have (on average 104.1) internal successors, (3123), 30 states have internal predecessors, (3123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:07,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:20:07,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 399 [2023-11-17 16:20:07,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:20:26,351 INFO L124 PetriNetUnfolderBase]: 27687/39291 cut-off events. [2023-11-17 16:20:26,351 INFO L125 PetriNetUnfolderBase]: For 757013/757013 co-relation queries the response was YES. [2023-11-17 16:20:27,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356860 conditions, 39291 events. 27687/39291 cut-off events. For 757013/757013 co-relation queries the response was YES. Maximal size of possible extension queue 1511. Compared 243849 event pairs, 3289 based on Foata normal form. 2/39293 useless extension candidates. Maximal degree in co-relation 356347. Up to 28266 conditions per place. [2023-11-17 16:20:27,583 INFO L140 encePairwiseOnDemand]: 386/399 looper letters, 2608 selfloop transitions, 1840 changer transitions 4/4452 dead transitions. [2023-11-17 16:20:27,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 4452 transitions, 92210 flow [2023-11-17 16:20:27,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-17 16:20:27,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-11-17 16:20:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 5211 transitions. [2023-11-17 16:20:27,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2778755399136138 [2023-11-17 16:20:27,587 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 5211 transitions. [2023-11-17 16:20:27,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 5211 transitions. [2023-11-17 16:20:27,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:20:27,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 5211 transitions. [2023-11-17 16:20:27,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 110.87234042553192) internal successors, (5211), 47 states have internal predecessors, (5211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:27,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 399.0) internal successors, (19152), 48 states have internal predecessors, (19152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:27,602 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 399.0) internal successors, (19152), 48 states have internal predecessors, (19152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:27,602 INFO L175 Difference]: Start difference. First operand has 472 places, 3132 transitions, 58861 flow. Second operand 47 states and 5211 transitions. [2023-11-17 16:20:27,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 4452 transitions, 92210 flow [2023-11-17 16:20:41,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 508 places, 4452 transitions, 87827 flow, removed 2066 selfloop flow, removed 10 redundant places. [2023-11-17 16:20:41,858 INFO L231 Difference]: Finished difference. Result has 527 places, 4140 transitions, 81359 flow [2023-11-17 16:20:41,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=56298, PETRI_DIFFERENCE_MINUEND_PLACES=462, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1016, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=81359, PETRI_PLACES=527, PETRI_TRANSITIONS=4140} [2023-11-17 16:20:41,860 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 494 predicate places. [2023-11-17 16:20:41,860 INFO L495 AbstractCegarLoop]: Abstraction has has 527 places, 4140 transitions, 81359 flow [2023-11-17 16:20:41,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 104.1) internal successors, (3123), 30 states have internal predecessors, (3123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:41,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:20:41,861 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-11-17 16:20:41,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-17 16:20:42,061 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,SelfDestructingSolverStorable14 [2023-11-17 16:20:42,061 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-11-17 16:20:42,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:20:42,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1753958388, now seen corresponding path program 12 times [2023-11-17 16:20:42,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:20:42,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823022154] [2023-11-17 16:20:42,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:42,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:20:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:20:42,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:20:42,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823022154] [2023-11-17 16:20:42,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823022154] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:20:42,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285981330] [2023-11-17 16:20:42,130 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 16:20:42,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:20:42,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:20:42,131 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-11-17 16:20:42,139 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-11-17 16:20:42,242 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-17 16:20:42,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:20:42,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:20:42,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:20:42,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:20:42,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:20:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:20:42,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285981330] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:20:42,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:20:42,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-17 16:20:42,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320559194] [2023-11-17 16:20:42,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:20:42,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 16:20:42,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:20:42,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 16:20:42,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-11-17 16:20:42,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 399 [2023-11-17 16:20:42,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 4140 transitions, 81359 flow. Second operand has 14 states, 14 states have (on average 147.14285714285714) internal successors, (2060), 14 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:42,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:20:42,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 399 [2023-11-17 16:20:42,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:07,590 INFO L124 PetriNetUnfolderBase]: 28221/41380 cut-off events. [2023-11-17 16:21:07,590 INFO L125 PetriNetUnfolderBase]: For 904865/904865 co-relation queries the response was YES. [2023-11-17 16:21:08,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377665 conditions, 41380 events. 28221/41380 cut-off events. For 904865/904865 co-relation queries the response was YES. Maximal size of possible extension queue 1689. Compared 279145 event pairs, 5183 based on Foata normal form. 2323/43703 useless extension candidates. Maximal degree in co-relation 377100. Up to 20998 conditions per place. [2023-11-17 16:21:08,954 INFO L140 encePairwiseOnDemand]: 391/399 looper letters, 4411 selfloop transitions, 604 changer transitions 16/5031 dead transitions. [2023-11-17 16:21:08,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 5031 transitions, 109493 flow [2023-11-17 16:21:08,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:21:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 16:21:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1383 transitions. [2023-11-17 16:21:08,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38512949039264827 [2023-11-17 16:21:08,956 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1383 transitions. [2023-11-17 16:21:08,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1383 transitions. [2023-11-17 16:21:08,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:08,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1383 transitions. [2023-11-17 16:21:08,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 153.66666666666666) internal successors, (1383), 9 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:08,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 399.0) internal successors, (3990), 10 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:08,960 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 399.0) internal successors, (3990), 10 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:08,961 INFO L175 Difference]: Start difference. First operand has 527 places, 4140 transitions, 81359 flow. Second operand 9 states and 1383 transitions. [2023-11-17 16:21:08,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 5031 transitions, 109493 flow [2023-11-17 16:21:26,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 5031 transitions, 106127 flow, removed 1182 selfloop flow, removed 16 redundant places. [2023-11-17 16:21:26,403 INFO L231 Difference]: Finished difference. Result has 522 places, 3597 transitions, 71255 flow [2023-11-17 16:21:26,405 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=68295, PETRI_DIFFERENCE_MINUEND_PLACES=511, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=573, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2971, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=71255, PETRI_PLACES=522, PETRI_TRANSITIONS=3597} [2023-11-17 16:21:26,405 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 489 predicate places. [2023-11-17 16:21:26,405 INFO L495 AbstractCegarLoop]: Abstraction has has 522 places, 3597 transitions, 71255 flow [2023-11-17 16:21:26,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 147.14285714285714) internal successors, (2060), 14 states have internal predecessors, (2060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:26,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:26,406 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-11-17 16:21:26,415 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-11-17 16:21:26,608 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,SelfDestructingSolverStorable15 [2023-11-17 16:21:26,608 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-11-17 16:21:26,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:26,609 INFO L85 PathProgramCache]: Analyzing trace with hash 257137323, now seen corresponding path program 13 times [2023-11-17 16:21:26,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:26,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036299935] [2023-11-17 16:21:26,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:26,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:21:26,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:26,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036299935] [2023-11-17 16:21:26,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036299935] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:26,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368821933] [2023-11-17 16:21:26,693 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 16:21:26,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:26,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:26,697 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-11-17 16:21:26,700 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-11-17 16:21:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:26,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:21:26,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:21:26,846 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:21:26,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368821933] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:26,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:26,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-11-17 16:21:26,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518142822] [2023-11-17 16:21:26,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:26,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-17 16:21:26,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:26,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-17 16:21:26,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2023-11-17 16:21:26,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 399 [2023-11-17 16:21:26,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 3597 transitions, 71255 flow. Second operand has 15 states, 15 states have (on average 150.53333333333333) internal successors, (2258), 15 states have internal predecessors, (2258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:26,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:26,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 399 [2023-11-17 16:21:26,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:02,337 INFO L124 PetriNetUnfolderBase]: 43267/63407 cut-off events. [2023-11-17 16:22:02,337 INFO L125 PetriNetUnfolderBase]: For 1361369/1361369 co-relation queries the response was YES. [2023-11-17 16:22:05,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583288 conditions, 63407 events. 43267/63407 cut-off events. For 1361369/1361369 co-relation queries the response was YES. Maximal size of possible extension queue 2638. Compared 449870 event pairs, 13481 based on Foata normal form. 1/63408 useless extension candidates. Maximal degree in co-relation 583114. Up to 35296 conditions per place. [2023-11-17 16:22:05,372 INFO L140 encePairwiseOnDemand]: 394/399 looper letters, 5473 selfloop transitions, 14 changer transitions 0/5487 dead transitions. [2023-11-17 16:22:05,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 5487 transitions, 118849 flow [2023-11-17 16:22:05,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 16:22:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 16:22:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1244 transitions. [2023-11-17 16:22:05,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38972431077694236 [2023-11-17 16:22:05,374 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1244 transitions. [2023-11-17 16:22:05,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1244 transitions. [2023-11-17 16:22:05,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:05,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1244 transitions. [2023-11-17 16:22:05,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 155.5) internal successors, (1244), 8 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:05,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 399.0) internal successors, (3591), 9 states have internal predecessors, (3591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:05,377 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 399.0) internal successors, (3591), 9 states have internal predecessors, (3591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:05,377 INFO L175 Difference]: Start difference. First operand has 522 places, 3597 transitions, 71255 flow. Second operand 8 states and 1244 transitions. [2023-11-17 16:22:05,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 5487 transitions, 118849 flow [2023-11-17 16:22:46,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 5487 transitions, 116649 flow, removed 290 selfloop flow, removed 39 redundant places. [2023-11-17 16:22:46,985 INFO L231 Difference]: Finished difference. Result has 466 places, 2989 transitions, 57115 flow [2023-11-17 16:22:46,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=57087, PETRI_DIFFERENCE_MINUEND_PLACES=459, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2989, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2975, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=57115, PETRI_PLACES=466, PETRI_TRANSITIONS=2989} [2023-11-17 16:22:46,988 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 433 predicate places. [2023-11-17 16:22:46,988 INFO L495 AbstractCegarLoop]: Abstraction has has 466 places, 2989 transitions, 57115 flow [2023-11-17 16:22:46,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 150.53333333333333) internal successors, (2258), 15 states have internal predecessors, (2258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:46,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:46,988 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-11-17 16:22:46,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-17 16:22:47,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:47,193 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-11-17 16:22:47,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:47,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1426660439, now seen corresponding path program 14 times [2023-11-17 16:22:47,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:47,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900483044] [2023-11-17 16:22:47,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:47,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:47,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:47,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900483044] [2023-11-17 16:22:47,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900483044] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:47,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529448660] [2023-11-17 16:22:47,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:22:47,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:47,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:47,289 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-11-17 16:22:47,293 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-11-17 16:22:47,411 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:22:47,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:47,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 16:22:47,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:47,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:47,548 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:47,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529448660] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:47,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:47,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-11-17 16:22:47,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617183888] [2023-11-17 16:22:47,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:47,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-17 16:22:47,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:47,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-17 16:22:47,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-11-17 16:22:47,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 399 [2023-11-17 16:22:47,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 466 places, 2989 transitions, 57115 flow. Second operand has 15 states, 15 states have (on average 143.46666666666667) internal successors, (2152), 15 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:47,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:47,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 399 [2023-11-17 16:22:47,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:23:00,190 INFO L124 PetriNetUnfolderBase]: 16511/25485 cut-off events. [2023-11-17 16:23:00,190 INFO L125 PetriNetUnfolderBase]: For 501419/501419 co-relation queries the response was YES. [2023-11-17 16:23:00,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215079 conditions, 25485 events. 16511/25485 cut-off events. For 501419/501419 co-relation queries the response was YES. Maximal size of possible extension queue 1320. Compared 179146 event pairs, 3093 based on Foata normal form. 2124/27609 useless extension candidates. Maximal degree in co-relation 214926. Up to 7889 conditions per place. [2023-11-17 16:23:00,592 INFO L140 encePairwiseOnDemand]: 390/399 looper letters, 1361 selfloop transitions, 272 changer transitions 52/1685 dead transitions. [2023-11-17 16:23:00,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 1685 transitions, 33556 flow [2023-11-17 16:23:00,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 16:23:00,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 16:23:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1486 transitions. [2023-11-17 16:23:00,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3724310776942356 [2023-11-17 16:23:00,594 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1486 transitions. [2023-11-17 16:23:00,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1486 transitions. [2023-11-17 16:23:00,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:23:00,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1486 transitions. [2023-11-17 16:23:00,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 148.6) internal successors, (1486), 10 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:00,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 399.0) internal successors, (4389), 11 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:00,597 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 399.0) internal successors, (4389), 11 states have internal predecessors, (4389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:00,597 INFO L175 Difference]: Start difference. First operand has 466 places, 2989 transitions, 57115 flow. Second operand 10 states and 1486 transitions. [2023-11-17 16:23:00,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 1685 transitions, 33556 flow [2023-11-17 16:23:06,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 1685 transitions, 31819 flow, removed 269 selfloop flow, removed 46 redundant places. [2023-11-17 16:23:06,671 INFO L231 Difference]: Finished difference. Result has 398 places, 1443 transitions, 25821 flow [2023-11-17 16:23:06,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=24257, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=217, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=25821, PETRI_PLACES=398, PETRI_TRANSITIONS=1443} [2023-11-17 16:23:06,673 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 365 predicate places. [2023-11-17 16:23:06,673 INFO L495 AbstractCegarLoop]: Abstraction has has 398 places, 1443 transitions, 25821 flow [2023-11-17 16:23:06,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 143.46666666666667) internal successors, (2152), 15 states have internal predecessors, (2152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:06,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:23:06,673 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-11-17 16:23:06,680 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-11-17 16:23:06,881 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,SelfDestructingSolverStorable17 [2023-11-17 16:23:06,881 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-11-17 16:23:06,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:23:06,881 INFO L85 PathProgramCache]: Analyzing trace with hash -913547282, now seen corresponding path program 1 times [2023-11-17 16:23:06,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:23:06,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516644152] [2023-11-17 16:23:06,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:23:06,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:23:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:23:06,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:23:06,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:23:06,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516644152] [2023-11-17 16:23:06,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516644152] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:23:06,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355329616] [2023-11-17 16:23:06,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:23:06,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:06,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:23:06,965 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-11-17 16:23:06,967 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-11-17 16:23:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:23:07,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:23:07,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:23:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:23:07,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:23:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:23:07,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355329616] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:23:07,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:23:07,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-17 16:23:07,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645153869] [2023-11-17 16:23:07,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:23:07,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 16:23:07,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:23:07,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 16:23:07,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2023-11-17 16:23:07,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 399 [2023-11-17 16:23:07,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 1443 transitions, 25821 flow. Second operand has 14 states, 14 states have (on average 142.42857142857142) internal successors, (1994), 14 states have internal predecessors, (1994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:07,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:23:07,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 399 [2023-11-17 16:23:07,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:23:10,513 INFO L124 PetriNetUnfolderBase]: 7623/12133 cut-off events. [2023-11-17 16:23:10,513 INFO L125 PetriNetUnfolderBase]: For 181382/181382 co-relation queries the response was YES. [2023-11-17 16:23:10,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92627 conditions, 12133 events. 7623/12133 cut-off events. For 181382/181382 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 80018 event pairs, 2459 based on Foata normal form. 756/12889 useless extension candidates. Maximal degree in co-relation 92503. Up to 7202 conditions per place. [2023-11-17 16:23:10,648 INFO L140 encePairwiseOnDemand]: 391/399 looper letters, 713 selfloop transitions, 6 changer transitions 236/955 dead transitions. [2023-11-17 16:23:10,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 955 transitions, 17951 flow [2023-11-17 16:23:10,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 16:23:10,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 16:23:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1181 transitions. [2023-11-17 16:23:10,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3699874686716792 [2023-11-17 16:23:10,649 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1181 transitions. [2023-11-17 16:23:10,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1181 transitions. [2023-11-17 16:23:10,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:23:10,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1181 transitions. [2023-11-17 16:23:10,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 147.625) internal successors, (1181), 8 states have internal predecessors, (1181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:10,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 399.0) internal successors, (3591), 9 states have internal predecessors, (3591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:10,652 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 399.0) internal successors, (3591), 9 states have internal predecessors, (3591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:10,652 INFO L175 Difference]: Start difference. First operand has 398 places, 1443 transitions, 25821 flow. Second operand 8 states and 1181 transitions. [2023-11-17 16:23:10,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 955 transitions, 17951 flow [2023-11-17 16:23:11,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 955 transitions, 16206 flow, removed 317 selfloop flow, removed 37 redundant places. [2023-11-17 16:23:11,745 INFO L231 Difference]: Finished difference. Result has 322 places, 719 transitions, 10909 flow [2023-11-17 16:23:11,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=13284, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=869, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=863, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10909, PETRI_PLACES=322, PETRI_TRANSITIONS=719} [2023-11-17 16:23:11,746 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 289 predicate places. [2023-11-17 16:23:11,746 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 719 transitions, 10909 flow [2023-11-17 16:23:11,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 142.42857142857142) internal successors, (1994), 14 states have internal predecessors, (1994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:11,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:23:11,746 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-11-17 16:23:11,751 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-11-17 16:23:11,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:11,947 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-11-17 16:23:11,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:23:11,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1420978867, now seen corresponding path program 15 times [2023-11-17 16:23:11,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:23:11,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624140045] [2023-11-17 16:23:11,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:23:11,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:23:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:23:12,031 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:23:12,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:23:12,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624140045] [2023-11-17 16:23:12,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624140045] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:23:12,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586973853] [2023-11-17 16:23:12,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:23:12,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:12,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:23:12,033 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-11-17 16:23:12,035 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-11-17 16:23:12,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 16:23:12,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:23:12,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:23:12,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:23:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 16:23:12,234 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:23:12,335 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 16:23:12,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586973853] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:23:12,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:23:12,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 19 [2023-11-17 16:23:12,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087442030] [2023-11-17 16:23:12,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:23:12,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 16:23:12,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:23:12,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 16:23:12,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2023-11-17 16:23:12,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 399 [2023-11-17 16:23:12,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 719 transitions, 10909 flow. Second operand has 20 states, 20 states have (on average 134.9) internal successors, (2698), 20 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:12,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:23:12,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 399 [2023-11-17 16:23:12,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:23:15,076 INFO L124 PetriNetUnfolderBase]: 4708/6773 cut-off events. [2023-11-17 16:23:15,077 INFO L125 PetriNetUnfolderBase]: For 107399/107399 co-relation queries the response was YES. [2023-11-17 16:23:15,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62806 conditions, 6773 events. 4708/6773 cut-off events. For 107399/107399 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 34434 event pairs, 154 based on Foata normal form. 604/7377 useless extension candidates. Maximal degree in co-relation 62703. Up to 3587 conditions per place. [2023-11-17 16:23:15,157 INFO L140 encePairwiseOnDemand]: 382/399 looper letters, 431 selfloop transitions, 1056 changer transitions 0/1487 dead transitions. [2023-11-17 16:23:15,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 1487 transitions, 26938 flow [2023-11-17 16:23:15,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-11-17 16:23:15,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2023-11-17 16:23:15,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 9607 transitions. [2023-11-17 16:23:15,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3489520903708547 [2023-11-17 16:23:15,164 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 9607 transitions. [2023-11-17 16:23:15,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 9607 transitions. [2023-11-17 16:23:15,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:23:15,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 9607 transitions. [2023-11-17 16:23:15,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 70 states, 69 states have (on average 139.231884057971) internal successors, (9607), 69 states have internal predecessors, (9607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:15,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 70 states, 70 states have (on average 399.0) internal successors, (27930), 70 states have internal predecessors, (27930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:15,353 INFO L81 ComplementDD]: Finished complementDD. Result has 70 states, 70 states have (on average 399.0) internal successors, (27930), 70 states have internal predecessors, (27930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:15,353 INFO L175 Difference]: Start difference. First operand has 322 places, 719 transitions, 10909 flow. Second operand 69 states and 9607 transitions. [2023-11-17 16:23:15,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 1487 transitions, 26938 flow [2023-11-17 16:23:15,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 1487 transitions, 23865 flow, removed 1087 selfloop flow, removed 37 redundant places. [2023-11-17 16:23:15,677 INFO L231 Difference]: Finished difference. Result has 268 places, 1246 transitions, 22598 flow [2023-11-17 16:23:15,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=5797, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=347, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=22598, PETRI_PLACES=268, PETRI_TRANSITIONS=1246} [2023-11-17 16:23:15,678 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 235 predicate places. [2023-11-17 16:23:15,678 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 1246 transitions, 22598 flow [2023-11-17 16:23:15,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 134.9) internal successors, (2698), 20 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:15,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:23:15,678 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-11-17 16:23:15,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-17 16:23:15,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:15,883 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-11-17 16:23:15,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:23:15,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1456498013, now seen corresponding path program 16 times [2023-11-17 16:23:15,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:23:15,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826418838] [2023-11-17 16:23:15,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:23:15,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:23:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:23:16,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:23:16,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:23:16,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826418838] [2023-11-17 16:23:16,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826418838] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:23:16,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650171791] [2023-11-17 16:23:16,101 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:23:16,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:16,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:23:16,102 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-11-17 16:23:16,107 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-11-17 16:23:16,213 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:23:16,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:23:16,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:23:16,216 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:23:16,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:23:16,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:23:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:23:16,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650171791] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:23:16,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:23:16,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2023-11-17 16:23:16,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453054555] [2023-11-17 16:23:16,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:23:16,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 16:23:16,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:23:16,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 16:23:16,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2023-11-17 16:23:16,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 399 [2023-11-17 16:23:16,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 1246 transitions, 22598 flow. Second operand has 19 states, 19 states have (on average 138.21052631578948) internal successors, (2626), 19 states have internal predecessors, (2626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:16,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:23:16,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 399 [2023-11-17 16:23:16,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:23:18,749 INFO L124 PetriNetUnfolderBase]: 6138/8856 cut-off events. [2023-11-17 16:23:18,749 INFO L125 PetriNetUnfolderBase]: For 224126/224126 co-relation queries the response was YES. [2023-11-17 16:23:18,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89986 conditions, 8856 events. 6138/8856 cut-off events. For 224126/224126 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 46689 event pairs, 478 based on Foata normal form. 40/8896 useless extension candidates. Maximal degree in co-relation 89884. Up to 4729 conditions per place. [2023-11-17 16:23:18,844 INFO L140 encePairwiseOnDemand]: 387/399 looper letters, 987 selfloop transitions, 724 changer transitions 0/1711 dead transitions. [2023-11-17 16:23:18,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 1711 transitions, 34827 flow [2023-11-17 16:23:18,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-17 16:23:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-17 16:23:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2016 transitions. [2023-11-17 16:23:18,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3609022556390977 [2023-11-17 16:23:18,846 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2016 transitions. [2023-11-17 16:23:18,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2016 transitions. [2023-11-17 16:23:18,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:23:18,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2016 transitions. [2023-11-17 16:23:18,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 144.0) internal successors, (2016), 14 states have internal predecessors, (2016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:18,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 399.0) internal successors, (5985), 15 states have internal predecessors, (5985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:18,851 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 399.0) internal successors, (5985), 15 states have internal predecessors, (5985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:18,851 INFO L175 Difference]: Start difference. First operand has 268 places, 1246 transitions, 22598 flow. Second operand 14 states and 2016 transitions. [2023-11-17 16:23:18,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 1711 transitions, 34827 flow [2023-11-17 16:23:20,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 1711 transitions, 30591 flow, removed 1586 selfloop flow, removed 12 redundant places. [2023-11-17 16:23:20,190 INFO L231 Difference]: Finished difference. Result has 273 places, 1456 transitions, 25834 flow [2023-11-17 16:23:20,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=19314, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=502, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=25834, PETRI_PLACES=273, PETRI_TRANSITIONS=1456} [2023-11-17 16:23:20,191 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 240 predicate places. [2023-11-17 16:23:20,191 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 1456 transitions, 25834 flow [2023-11-17 16:23:20,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 138.21052631578948) internal successors, (2626), 19 states have internal predecessors, (2626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:20,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:23:20,192 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-11-17 16:23:20,198 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-11-17 16:23:20,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:20,392 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-11-17 16:23:20,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:23:20,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1089186615, now seen corresponding path program 17 times [2023-11-17 16:23:20,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:23:20,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530343656] [2023-11-17 16:23:20,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:23:20,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:23:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:23:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:23:20,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:23:20,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530343656] [2023-11-17 16:23:20,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530343656] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:23:20,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457803839] [2023-11-17 16:23:20,501 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:23:20,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:20,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:23:20,503 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-11-17 16:23:20,509 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-11-17 16:23:20,625 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:23:20,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:23:20,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:23:20,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:23:20,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:23:20,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:23:20,761 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:23:20,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457803839] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:23:20,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:23:20,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-11-17 16:23:20,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070805166] [2023-11-17 16:23:20,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:23:20,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-17 16:23:20,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:23:20,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-17 16:23:20,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-11-17 16:23:20,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 399 [2023-11-17 16:23:20,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 1456 transitions, 25834 flow. Second operand has 18 states, 18 states have (on average 134.77777777777777) internal successors, (2426), 18 states have internal predecessors, (2426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:20,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:23:20,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 399 [2023-11-17 16:23:20,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:23:24,577 INFO L124 PetriNetUnfolderBase]: 7710/11112 cut-off events. [2023-11-17 16:23:24,577 INFO L125 PetriNetUnfolderBase]: For 260399/260399 co-relation queries the response was YES. [2023-11-17 16:23:24,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110931 conditions, 11112 events. 7710/11112 cut-off events. For 260399/260399 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 59801 event pairs, 128 based on Foata normal form. 18/11130 useless extension candidates. Maximal degree in co-relation 110831. Up to 5643 conditions per place. [2023-11-17 16:23:24,695 INFO L140 encePairwiseOnDemand]: 383/399 looper letters, 763 selfloop transitions, 1627 changer transitions 0/2390 dead transitions. [2023-11-17 16:23:24,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 2390 transitions, 48197 flow [2023-11-17 16:23:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-17 16:23:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-11-17 16:23:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 5411 transitions. [2023-11-17 16:23:24,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34772829509671616 [2023-11-17 16:23:24,699 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 5411 transitions. [2023-11-17 16:23:24,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 5411 transitions. [2023-11-17 16:23:24,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:23:24,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 5411 transitions. [2023-11-17 16:23:24,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 138.74358974358975) internal successors, (5411), 39 states have internal predecessors, (5411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:24,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 399.0) internal successors, (15960), 40 states have internal predecessors, (15960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:24,709 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 399.0) internal successors, (15960), 40 states have internal predecessors, (15960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:24,709 INFO L175 Difference]: Start difference. First operand has 273 places, 1456 transitions, 25834 flow. Second operand 39 states and 5411 transitions. [2023-11-17 16:23:24,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 2390 transitions, 48197 flow [2023-11-17 16:23:26,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 2390 transitions, 47998 flow, removed 89 selfloop flow, removed 7 redundant places. [2023-11-17 16:23:26,842 INFO L231 Difference]: Finished difference. Result has 322 places, 2099 transitions, 44508 flow [2023-11-17 16:23:26,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=25725, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=994, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=44508, PETRI_PLACES=322, PETRI_TRANSITIONS=2099} [2023-11-17 16:23:26,843 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 289 predicate places. [2023-11-17 16:23:26,844 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 2099 transitions, 44508 flow [2023-11-17 16:23:26,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 134.77777777777777) internal successors, (2426), 18 states have internal predecessors, (2426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:26,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:23:26,844 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-11-17 16:23:26,851 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-11-17 16:23:27,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:27,045 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-11-17 16:23:27,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:23:27,045 INFO L85 PathProgramCache]: Analyzing trace with hash 651093797, now seen corresponding path program 18 times [2023-11-17 16:23:27,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:23:27,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878882480] [2023-11-17 16:23:27,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:23:27,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:23:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:23:27,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 16:23:27,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:23:27,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878882480] [2023-11-17 16:23:27,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878882480] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:23:27,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538152289] [2023-11-17 16:23:27,154 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 16:23:27,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:27,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:23:27,155 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-11-17 16:23:27,155 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-11-17 16:23:27,345 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-17 16:23:27,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:23:27,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:23:27,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:23:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 16:23:27,443 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:23:27,528 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 16:23:27,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538152289] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:23:27,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:23:27,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-11-17 16:23:27,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316349284] [2023-11-17 16:23:27,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:23:27,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-17 16:23:27,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:23:27,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-17 16:23:27,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-11-17 16:23:27,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 399 [2023-11-17 16:23:27,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 2099 transitions, 44508 flow. Second operand has 21 states, 21 states have (on average 138.8095238095238) internal successors, (2915), 21 states have internal predecessors, (2915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:27,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:23:27,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 399 [2023-11-17 16:23:27,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:23:32,682 INFO L124 PetriNetUnfolderBase]: 9028/12984 cut-off events. [2023-11-17 16:23:32,683 INFO L125 PetriNetUnfolderBase]: For 366268/366268 co-relation queries the response was YES. [2023-11-17 16:23:32,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143680 conditions, 12984 events. 9028/12984 cut-off events. For 366268/366268 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 71490 event pairs, 559 based on Foata normal form. 24/13008 useless extension candidates. Maximal degree in co-relation 143564. Up to 6739 conditions per place. [2023-11-17 16:23:32,964 INFO L140 encePairwiseOnDemand]: 385/399 looper letters, 1296 selfloop transitions, 1786 changer transitions 0/3082 dead transitions. [2023-11-17 16:23:32,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 3082 transitions, 72340 flow [2023-11-17 16:23:32,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-17 16:23:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-11-17 16:23:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4060 transitions. [2023-11-17 16:23:32,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3634085213032581 [2023-11-17 16:23:32,967 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 4060 transitions. [2023-11-17 16:23:32,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 4060 transitions. [2023-11-17 16:23:32,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:23:32,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4060 transitions. [2023-11-17 16:23:32,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 145.0) internal successors, (4060), 28 states have internal predecessors, (4060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:32,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 399.0) internal successors, (11571), 29 states have internal predecessors, (11571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:32,975 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 399.0) internal successors, (11571), 29 states have internal predecessors, (11571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:32,975 INFO L175 Difference]: Start difference. First operand has 322 places, 2099 transitions, 44508 flow. Second operand 28 states and 4060 transitions. [2023-11-17 16:23:32,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 3082 transitions, 72340 flow [2023-11-17 16:23:36,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 3082 transitions, 71033 flow, removed 648 selfloop flow, removed 6 redundant places. [2023-11-17 16:23:36,369 INFO L231 Difference]: Finished difference. Result has 349 places, 2544 transitions, 58656 flow [2023-11-17 16:23:36,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=43655, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2099, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1359, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=58656, PETRI_PLACES=349, PETRI_TRANSITIONS=2544} [2023-11-17 16:23:36,371 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 316 predicate places. [2023-11-17 16:23:36,371 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 2544 transitions, 58656 flow [2023-11-17 16:23:36,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 138.8095238095238) internal successors, (2915), 21 states have internal predecessors, (2915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:36,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:23:36,372 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-11-17 16:23:36,377 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-11-17 16:23:36,572 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,SelfDestructingSolverStorable22 [2023-11-17 16:23:36,572 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-11-17 16:23:36,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:23:36,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1165122809, now seen corresponding path program 19 times [2023-11-17 16:23:36,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:23:36,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463240807] [2023-11-17 16:23:36,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:23:36,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:23:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:23:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:23:36,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:23:36,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463240807] [2023-11-17 16:23:36,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463240807] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:23:36,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586342876] [2023-11-17 16:23:36,676 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 16:23:36,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:36,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:23:36,681 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-11-17 16:23:36,683 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-11-17 16:23:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:23:36,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:23:36,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:23:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:23:36,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:23:36,958 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:23:36,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586342876] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:23:36,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:23:36,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-11-17 16:23:36,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493904547] [2023-11-17 16:23:36,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:23:36,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-17 16:23:36,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:23:36,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-17 16:23:36,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2023-11-17 16:23:36,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 399 [2023-11-17 16:23:36,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 2544 transitions, 58656 flow. Second operand has 21 states, 21 states have (on average 138.14285714285714) internal successors, (2901), 21 states have internal predecessors, (2901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:36,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:23:36,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 399 [2023-11-17 16:23:36,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:23:44,192 INFO L124 PetriNetUnfolderBase]: 10855/15551 cut-off events. [2023-11-17 16:23:44,192 INFO L125 PetriNetUnfolderBase]: For 449508/449508 co-relation queries the response was YES. [2023-11-17 16:23:44,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179910 conditions, 15551 events. 10855/15551 cut-off events. For 449508/449508 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 86715 event pairs, 362 based on Foata normal form. 24/15575 useless extension candidates. Maximal degree in co-relation 179789. Up to 7963 conditions per place. [2023-11-17 16:23:44,392 INFO L140 encePairwiseOnDemand]: 385/399 looper letters, 1663 selfloop transitions, 1817 changer transitions 0/3480 dead transitions. [2023-11-17 16:23:44,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 3480 transitions, 86540 flow [2023-11-17 16:23:44,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-17 16:23:44,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-11-17 16:23:44,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 5534 transitions. [2023-11-17 16:23:44,396 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3649914259332542 [2023-11-17 16:23:44,396 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 5534 transitions. [2023-11-17 16:23:44,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 5534 transitions. [2023-11-17 16:23:44,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:23:44,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 5534 transitions. [2023-11-17 16:23:44,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 145.6315789473684) internal successors, (5534), 38 states have internal predecessors, (5534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:44,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 399.0) internal successors, (15561), 39 states have internal predecessors, (15561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:44,406 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 399.0) internal successors, (15561), 39 states have internal predecessors, (15561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:44,406 INFO L175 Difference]: Start difference. First operand has 349 places, 2544 transitions, 58656 flow. Second operand 38 states and 5534 transitions. [2023-11-17 16:23:44,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 3480 transitions, 86540 flow [2023-11-17 16:23:50,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 3480 transitions, 83979 flow, removed 408 selfloop flow, removed 11 redundant places. [2023-11-17 16:23:50,201 INFO L231 Difference]: Finished difference. Result has 382 places, 2901 transitions, 70099 flow [2023-11-17 16:23:50,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=56419, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1487, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1016, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=70099, PETRI_PLACES=382, PETRI_TRANSITIONS=2901} [2023-11-17 16:23:50,202 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 349 predicate places. [2023-11-17 16:23:50,202 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 2901 transitions, 70099 flow [2023-11-17 16:23:50,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 138.14285714285714) internal successors, (2901), 21 states have internal predecessors, (2901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:50,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:23:50,203 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-11-17 16:23:50,209 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-11-17 16:23:50,403 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,SelfDestructingSolverStorable23 [2023-11-17 16:23:50,403 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:23:50,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:23:50,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1959821949, now seen corresponding path program 20 times [2023-11-17 16:23:50,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:23:50,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553560345] [2023-11-17 16:23:50,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:23:50,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:23:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:23:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:23:50,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:23:50,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553560345] [2023-11-17 16:23:50,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553560345] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:23:50,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152474864] [2023-11-17 16:23:50,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:23:50,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:50,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:23:50,511 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-11-17 16:23:50,511 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-11-17 16:23:50,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:23:50,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:23:50,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:23:50,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:23:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:23:50,747 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:23:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:23:50,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152474864] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:23:50,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:23:50,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-11-17 16:23:50,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273331953] [2023-11-17 16:23:50,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:23:50,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-17 16:23:50,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:23:50,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-17 16:23:50,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2023-11-17 16:23:50,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 399 [2023-11-17 16:23:50,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 2901 transitions, 70099 flow. Second operand has 22 states, 22 states have (on average 138.27272727272728) internal successors, (3042), 22 states have internal predecessors, (3042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:50,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:23:50,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 399 [2023-11-17 16:23:50,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:23:59,366 INFO L124 PetriNetUnfolderBase]: 11579/16575 cut-off events. [2023-11-17 16:23:59,366 INFO L125 PetriNetUnfolderBase]: For 516812/516812 co-relation queries the response was YES. [2023-11-17 16:23:59,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196458 conditions, 16575 events. 11579/16575 cut-off events. For 516812/516812 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 93030 event pairs, 805 based on Foata normal form. 18/16593 useless extension candidates. Maximal degree in co-relation 196334. Up to 8371 conditions per place. [2023-11-17 16:23:59,608 INFO L140 encePairwiseOnDemand]: 386/399 looper letters, 1707 selfloop transitions, 1819 changer transitions 0/3526 dead transitions. [2023-11-17 16:23:59,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 3526 transitions, 89843 flow [2023-11-17 16:23:59,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-17 16:23:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-17 16:23:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2894 transitions. [2023-11-17 16:23:59,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36265664160401 [2023-11-17 16:23:59,610 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2894 transitions. [2023-11-17 16:23:59,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2894 transitions. [2023-11-17 16:23:59,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:23:59,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2894 transitions. [2023-11-17 16:23:59,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 144.7) internal successors, (2894), 20 states have internal predecessors, (2894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:59,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 399.0) internal successors, (8379), 21 states have internal predecessors, (8379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:59,616 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 399.0) internal successors, (8379), 21 states have internal predecessors, (8379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:59,616 INFO L175 Difference]: Start difference. First operand has 382 places, 2901 transitions, 70099 flow. Second operand 20 states and 2894 transitions. [2023-11-17 16:23:59,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 3526 transitions, 89843 flow [2023-11-17 16:24:06,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 3526 transitions, 85862 flow, removed 397 selfloop flow, removed 21 redundant places. [2023-11-17 16:24:07,022 INFO L231 Difference]: Finished difference. Result has 385 places, 3049 transitions, 76185 flow [2023-11-17 16:24:07,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=66607, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2898, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1668, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=76185, PETRI_PLACES=385, PETRI_TRANSITIONS=3049} [2023-11-17 16:24:07,024 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 352 predicate places. [2023-11-17 16:24:07,024 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 3049 transitions, 76185 flow [2023-11-17 16:24:07,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 138.27272727272728) internal successors, (3042), 22 states have internal predecessors, (3042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:07,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:07,025 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-11-17 16:24:07,030 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-11-17 16:24:07,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:07,225 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:24:07,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:07,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1757522231, now seen corresponding path program 21 times [2023-11-17 16:24:07,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:07,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020162928] [2023-11-17 16:24:07,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:07,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:24:07,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:07,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020162928] [2023-11-17 16:24:07,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020162928] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:07,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28413198] [2023-11-17 16:24:07,331 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:24:07,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:07,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:07,333 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-11-17 16:24:07,335 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-11-17 16:24:07,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 16:24:07,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:24:07,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:24:07,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:07,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:24:07,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:07,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:24:07,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28413198] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:24:07,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:24:07,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2023-11-17 16:24:07,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751295620] [2023-11-17 16:24:07,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:24:07,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 16:24:07,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:07,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 16:24:07,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-11-17 16:24:07,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 399 [2023-11-17 16:24:07,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 3049 transitions, 76185 flow. Second operand has 20 states, 20 states have (on average 138.3) internal successors, (2766), 20 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:07,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:07,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 399 [2023-11-17 16:24:07,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:16,136 INFO L124 PetriNetUnfolderBase]: 11599/16611 cut-off events. [2023-11-17 16:24:16,136 INFO L125 PetriNetUnfolderBase]: For 524256/524256 co-relation queries the response was YES. [2023-11-17 16:24:16,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198557 conditions, 16611 events. 11599/16611 cut-off events. For 524256/524256 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 93552 event pairs, 759 based on Foata normal form. 24/16635 useless extension candidates. Maximal degree in co-relation 198438. Up to 8401 conditions per place. [2023-11-17 16:24:16,398 INFO L140 encePairwiseOnDemand]: 385/399 looper letters, 1278 selfloop transitions, 2106 changer transitions 0/3384 dead transitions. [2023-11-17 16:24:16,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 3384 transitions, 90248 flow [2023-11-17 16:24:16,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-17 16:24:16,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-17 16:24:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2740 transitions. [2023-11-17 16:24:16,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3614298905157631 [2023-11-17 16:24:16,400 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2740 transitions. [2023-11-17 16:24:16,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2740 transitions. [2023-11-17 16:24:16,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:16,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2740 transitions. [2023-11-17 16:24:16,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 144.21052631578948) internal successors, (2740), 19 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:16,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 399.0) internal successors, (7980), 20 states have internal predecessors, (7980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:16,406 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 399.0) internal successors, (7980), 20 states have internal predecessors, (7980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:16,406 INFO L175 Difference]: Start difference. First operand has 385 places, 3049 transitions, 76185 flow. Second operand 19 states and 2740 transitions. [2023-11-17 16:24:16,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 3384 transitions, 90248 flow [2023-11-17 16:24:23,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 3384 transitions, 88156 flow, removed 69 selfloop flow, removed 8 redundant places. [2023-11-17 16:24:23,344 INFO L231 Difference]: Finished difference. Result has 395 places, 3053 transitions, 78521 flow [2023-11-17 16:24:23,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=73873, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3040, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2093, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=947, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=78521, PETRI_PLACES=395, PETRI_TRANSITIONS=3053} [2023-11-17 16:24:23,347 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 362 predicate places. [2023-11-17 16:24:23,347 INFO L495 AbstractCegarLoop]: Abstraction has has 395 places, 3053 transitions, 78521 flow [2023-11-17 16:24:23,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 138.3) internal successors, (2766), 20 states have internal predecessors, (2766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:23,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:23,347 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-11-17 16:24:23,353 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-11-17 16:24:23,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:23,548 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:24:23,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:23,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2020429463, now seen corresponding path program 22 times [2023-11-17 16:24:23,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:23,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454509424] [2023-11-17 16:24:23,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:23,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:24:23,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:23,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454509424] [2023-11-17 16:24:23,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454509424] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:23,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53567348] [2023-11-17 16:24:23,659 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:24:23,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:23,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:23,660 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:24:23,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-17 16:24:23,786 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:24:23,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:24:23,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:24:23,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:24:23,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:24:23,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53567348] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:24:23,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:24:23,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-11-17 16:24:23,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236618634] [2023-11-17 16:24:23,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:24:23,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-17 16:24:23,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:23,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-17 16:24:23,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2023-11-17 16:24:23,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 399 [2023-11-17 16:24:23,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 3053 transitions, 78521 flow. Second operand has 22 states, 22 states have (on average 138.0909090909091) internal successors, (3038), 22 states have internal predecessors, (3038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:23,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:23,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 399 [2023-11-17 16:24:23,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:35,622 INFO L124 PetriNetUnfolderBase]: 15644/22210 cut-off events. [2023-11-17 16:24:35,623 INFO L125 PetriNetUnfolderBase]: For 702593/702593 co-relation queries the response was YES. [2023-11-17 16:24:35,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270255 conditions, 22210 events. 15644/22210 cut-off events. For 702593/702593 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 127001 event pairs, 376 based on Foata normal form. 36/22246 useless extension candidates. Maximal degree in co-relation 270138. Up to 11365 conditions per place. [2023-11-17 16:24:36,090 INFO L140 encePairwiseOnDemand]: 386/399 looper letters, 1571 selfloop transitions, 2934 changer transitions 0/4505 dead transitions. [2023-11-17 16:24:36,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 4505 transitions, 121063 flow [2023-11-17 16:24:36,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-11-17 16:24:36,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2023-11-17 16:24:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 6271 transitions. [2023-11-17 16:24:36,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36550679023139243 [2023-11-17 16:24:36,094 INFO L72 ComplementDD]: Start complementDD. Operand 43 states and 6271 transitions. [2023-11-17 16:24:36,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 6271 transitions. [2023-11-17 16:24:36,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:36,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 43 states and 6271 transitions. [2023-11-17 16:24:36,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 44 states, 43 states have (on average 145.8372093023256) internal successors, (6271), 43 states have internal predecessors, (6271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:36,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 44 states, 44 states have (on average 399.0) internal successors, (17556), 44 states have internal predecessors, (17556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:36,106 INFO L81 ComplementDD]: Finished complementDD. Result has 44 states, 44 states have (on average 399.0) internal successors, (17556), 44 states have internal predecessors, (17556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:36,106 INFO L175 Difference]: Start difference. First operand has 395 places, 3053 transitions, 78521 flow. Second operand 43 states and 6271 transitions. [2023-11-17 16:24:36,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 4505 transitions, 121063 flow [2023-11-17 16:24:46,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 4505 transitions, 117005 flow, removed 94 selfloop flow, removed 17 redundant places. [2023-11-17 16:24:46,103 INFO L231 Difference]: Finished difference. Result has 422 places, 3761 transitions, 102142 flow [2023-11-17 16:24:46,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=75165, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3041, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=777, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=102142, PETRI_PLACES=422, PETRI_TRANSITIONS=3761} [2023-11-17 16:24:46,106 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 389 predicate places. [2023-11-17 16:24:46,106 INFO L495 AbstractCegarLoop]: Abstraction has has 422 places, 3761 transitions, 102142 flow [2023-11-17 16:24:46,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 138.0909090909091) internal successors, (3038), 22 states have internal predecessors, (3038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:46,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:46,106 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-11-17 16:24:46,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-11-17 16:24:46,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-17 16:24:46,316 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:24:46,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:46,316 INFO L85 PathProgramCache]: Analyzing trace with hash 498060279, now seen corresponding path program 23 times [2023-11-17 16:24:46,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:46,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126289800] [2023-11-17 16:24:46,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:46,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:46,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:24:46,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:46,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126289800] [2023-11-17 16:24:46,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126289800] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:46,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910692692] [2023-11-17 16:24:46,427 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:24:46,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:46,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:46,429 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:24:46,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-11-17 16:24:46,571 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:24:46,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:24:46,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:24:46,573 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:24:46,659 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:46,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:24:46,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910692692] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:24:46,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:24:46,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2023-11-17 16:24:46,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968210528] [2023-11-17 16:24:46,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:24:46,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-17 16:24:46,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:46,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-17 16:24:46,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-11-17 16:24:46,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 399 [2023-11-17 16:24:46,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 3761 transitions, 102142 flow. Second operand has 18 states, 18 states have (on average 134.77777777777777) internal successors, (2426), 18 states have internal predecessors, (2426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:46,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:46,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 399 [2023-11-17 16:24:46,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:25:00,345 INFO L124 PetriNetUnfolderBase]: 15612/22156 cut-off events. [2023-11-17 16:25:00,345 INFO L125 PetriNetUnfolderBase]: For 724105/724105 co-relation queries the response was YES. [2023-11-17 16:25:00,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277800 conditions, 22156 events. 15612/22156 cut-off events. For 724105/724105 co-relation queries the response was YES. Maximal size of possible extension queue 779. Compared 126623 event pairs, 515 based on Foata normal form. 24/22180 useless extension candidates. Maximal degree in co-relation 277681. Up to 11349 conditions per place. [2023-11-17 16:25:00,725 INFO L140 encePairwiseOnDemand]: 382/399 looper letters, 1178 selfloop transitions, 2842 changer transitions 0/4020 dead transitions. [2023-11-17 16:25:00,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 4020 transitions, 115294 flow [2023-11-17 16:25:00,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-17 16:25:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-11-17 16:25:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 5828 transitions. [2023-11-17 16:25:00,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34777419739825755 [2023-11-17 16:25:00,730 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 5828 transitions. [2023-11-17 16:25:00,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 5828 transitions. [2023-11-17 16:25:00,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:25:00,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 5828 transitions. [2023-11-17 16:25:00,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 138.76190476190476) internal successors, (5828), 42 states have internal predecessors, (5828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:00,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 399.0) internal successors, (17157), 43 states have internal predecessors, (17157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:00,743 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 399.0) internal successors, (17157), 43 states have internal predecessors, (17157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:00,743 INFO L175 Difference]: Start difference. First operand has 422 places, 3761 transitions, 102142 flow. Second operand 42 states and 5828 transitions. [2023-11-17 16:25:00,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 4020 transitions, 115294 flow [2023-11-17 16:25:10,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 4020 transitions, 114790 flow, removed 146 selfloop flow, removed 7 redundant places. [2023-11-17 16:25:11,018 INFO L231 Difference]: Finished difference. Result has 456 places, 3829 transitions, 109529 flow [2023-11-17 16:25:11,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=399, PETRI_DIFFERENCE_MINUEND_FLOW=101436, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3748, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2761, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=987, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=109529, PETRI_PLACES=456, PETRI_TRANSITIONS=3829} [2023-11-17 16:25:11,025 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 423 predicate places. [2023-11-17 16:25:11,025 INFO L495 AbstractCegarLoop]: Abstraction has has 456 places, 3829 transitions, 109529 flow [2023-11-17 16:25:11,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 134.77777777777777) internal successors, (2426), 18 states have internal predecessors, (2426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:11,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:25:11,026 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-11-17 16:25:11,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-11-17 16:25:11,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-17 16:25:11,231 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:25:11,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:25:11,232 INFO L85 PathProgramCache]: Analyzing trace with hash -575501997, now seen corresponding path program 2 times [2023-11-17 16:25:11,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:25:11,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75793291] [2023-11-17 16:25:11,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:25:11,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:25:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:25:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:25:12,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:25:12,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75793291] [2023-11-17 16:25:12,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75793291] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:25:12,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373966061] [2023-11-17 16:25:12,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:25:12,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:25:12,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:25:12,686 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:25:12,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-11-17 16:25:12,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:25:12,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:25:12,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-17 16:25:12,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:25:12,844 INFO L378 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 130 treesize of output 126 [2023-11-17 16:25:13,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:25:13,500 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 16:25:13,500 INFO L378 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 45 treesize of output 35 [2023-11-17 16:25:13,706 INFO L349 Elim1Store]: treesize reduction 48, result has 54.3 percent of original size [2023-11-17 16:25:13,706 INFO L378 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-11-17 16:25:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:25:13,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:25:14,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:25:14,676 INFO L378 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 306 treesize of output 434 [2023-11-17 16:25:14,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:25:14,696 INFO L378 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 106 treesize of output 90 [2023-11-17 16:25:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:25:48,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373966061] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:25:48,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:25:48,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 50 [2023-11-17 16:25:48,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143654673] [2023-11-17 16:25:48,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:25:48,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-17 16:25:48,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:25:48,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-17 16:25:48,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2460, Unknown=20, NotChecked=0, Total=2652 [2023-11-17 16:25:48,227 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 399 [2023-11-17 16:25:48,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 3829 transitions, 109529 flow. Second operand has 52 states, 52 states have (on average 99.51923076923077) internal successors, (5175), 52 states have internal predecessors, (5175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:48,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:25:48,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 399 [2023-11-17 16:25:48,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-11-17 16:26:01,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2023-11-17 16:26:01,419 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-17 16:26:01,419 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-11-17 16:26:01,420 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 16:26:01,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-11-17 16:26:01,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-17 16:26:01,624 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-17-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-9-2-3-2-2-1 context. [2023-11-17 16:26:01,626 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-17 16:26:01,626 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-17 16:26:01,626 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-17 16:26:01,626 INFO L445 BasicCegarLoop]: Path program histogram: [23, 2, 1, 1, 1, 1] [2023-11-17 16:26:01,628 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 16:26:01,629 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 16:26:01,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 04:26:01 BasicIcfg [2023-11-17 16:26:01,630 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 16:26:01,631 INFO L158 Benchmark]: Toolchain (without parser) took 515343.23ms. Allocated memory was 274.7MB in the beginning and 5.7GB in the end (delta: 5.4GB). Free memory was 228.5MB in the beginning and 1.3GB in the end (delta: -1.0GB). Peak memory consumption was 4.4GB. Max. memory is 8.0GB. [2023-11-17 16:26:01,631 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 177.2MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 16:26:01,631 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.74ms. Allocated memory is still 274.7MB. Free memory was 228.5MB in the beginning and 216.3MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-11-17 16:26:01,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.67ms. Allocated memory is still 274.7MB. Free memory was 216.3MB in the beginning and 213.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 16:26:01,631 INFO L158 Benchmark]: Boogie Preprocessor took 27.10ms. Allocated memory is still 274.7MB. Free memory was 213.8MB in the beginning and 211.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 16:26:01,631 INFO L158 Benchmark]: RCFGBuilder took 626.74ms. Allocated memory is still 274.7MB. Free memory was 211.2MB in the beginning and 140.9MB in the end (delta: 70.3MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. [2023-11-17 16:26:01,632 INFO L158 Benchmark]: TraceAbstraction took 514477.39ms. Allocated memory was 274.7MB in the beginning and 5.7GB in the end (delta: 5.4GB). Free memory was 140.4MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. [2023-11-17 16:26:01,632 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.10ms. Allocated memory is still 177.2MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 172.74ms. Allocated memory is still 274.7MB. Free memory was 228.5MB in the beginning and 216.3MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.67ms. Allocated memory is still 274.7MB. Free memory was 216.3MB in the beginning and 213.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.10ms. Allocated memory is still 274.7MB. Free memory was 213.8MB in the beginning and 211.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 626.74ms. Allocated memory is still 274.7MB. Free memory was 211.2MB in the beginning and 140.9MB in the end (delta: 70.3MB). Peak memory consumption was 70.3MB. Max. memory is 8.0GB. * TraceAbstraction took 514477.39ms. Allocated memory was 274.7MB in the beginning and 5.7GB in the end (delta: 5.4GB). Free memory was 140.4MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 184 PlacesBefore, 33 PlacesAfterwards, 190 TransitionsBefore, 28 TransitionsAfterwards, 1950 CoEnabledTransitionPairs, 8 FixpointIterations, 119 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 25 TrivialYvCompositions, 6 ConcurrentYvCompositions, 11 ChoiceCompositions, 195 TotalNumberOfCompositions, 2550 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2087, independent: 2032, independent conditional: 0, independent unconditional: 2032, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1299, independent: 1279, independent conditional: 0, independent unconditional: 1279, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1299, independent: 1279, independent conditional: 0, independent unconditional: 1279, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 20, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 38, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2087, independent: 753, independent conditional: 0, independent unconditional: 753, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 1299, unknown conditional: 0, unknown unconditional: 1299] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 94, Positive conditional cache size: 0, Positive unconditional cache size: 94, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-17-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-9-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-17-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-9-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-17-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-9-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-17-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-9-2-3-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 228 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: 514.4s, OverallIterations: 29, TraceHistogramMax: 2, PathProgramHistogramMax: 23, EmptinessCheckTime: 0.0s, AutomataDifference: 375.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 198 mSolverCounterUnknown, 6041 SdHoareTripleChecker+Valid, 20.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6041 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 17.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 538 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 694 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38919 IncrementalHoareTripleChecker+Invalid, 40349 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 694 mSolverCounterUnsat, 0 mSDtfsCounter, 38919 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2279 GetRequests, 1022 SyntacticMatches, 35 SemanticMatches, 1221 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 18381 ImplicationChecksByTransitivity, 28.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109529occurred in iteration=28, InterpolantAutomatonStates: 782, 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.4s SatisfiabilityAnalysisTime, 124.8s InterpolantComputationTime, 1491 NumberOfCodeBlocks, 1490 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 2122 ConstructedInterpolants, 27 QuantifiedInterpolants, 21345 SizeOfPredicates, 300 NumberOfNonLiveVariables, 7352 ConjunctsInSsa, 648 ConjunctsInUnsatCore, 81 InterpolantComputations, 4 PerfectInterpolantSequences, 293/514 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