./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array27_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array27_pattern.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e2a4cc1bd1815c470836bbbcc9d3775eac69b651b7231d974ae63a065851dd1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 17:13:22,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:13:22,229 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 17:13:22,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:13:22,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:13:22,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:13:22,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:13:22,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:13:22,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:13:22,261 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:13:22,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:13:22,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:13:22,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:13:22,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:13:22,262 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:13:22,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:13:22,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:13:22,262 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:13:22,262 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 17:13:22,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:13:22,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:13:22,262 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:13:22,262 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:13:22,262 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:13:22,263 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:13:22,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:13:22,263 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:13:22,263 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:13:22,263 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:13:22,263 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:13:22,263 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:13:22,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:13:22,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:13:22,263 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:13:22,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:13:22,263 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:13:22,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:13:22,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 17:13:22,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 17:13:22,263 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:13:22,263 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:13:22,263 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:13:22,263 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:13:22,263 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e2a4cc1bd1815c470836bbbcc9d3775eac69b651b7231d974ae63a065851dd1 [2025-02-07 17:13:22,476 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:13:22,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:13:22,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:13:22,486 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:13:22,486 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:13:22,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array27_pattern.c [2025-02-07 17:13:23,611 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ba795f7d/b0b76bebf1f84c94b47e75090348e773/FLAG347bbe9f0 [2025-02-07 17:13:23,848 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:13:23,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array27_pattern.c [2025-02-07 17:13:23,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ba795f7d/b0b76bebf1f84c94b47e75090348e773/FLAG347bbe9f0 [2025-02-07 17:13:24,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1ba795f7d/b0b76bebf1f84c94b47e75090348e773 [2025-02-07 17:13:24,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:13:24,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:13:24,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:13:24,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:13:24,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:13:24,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e878d9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24, skipping insertion in model container [2025-02-07 17:13:24,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:13:24,289 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array27_pattern.c[1253,1266] [2025-02-07 17:13:24,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:13:24,311 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:13:24,319 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array27_pattern.c[1253,1266] [2025-02-07 17:13:24,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:13:24,337 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:13:24,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24 WrapperNode [2025-02-07 17:13:24,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:13:24,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:13:24,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:13:24,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:13:24,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,354 INFO L138 Inliner]: procedures = 16, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2025-02-07 17:13:24,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:13:24,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:13:24,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:13:24,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:13:24,359 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,360 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,368 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-07 17:13:24,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,371 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:13:24,373 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:13:24,373 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:13:24,374 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:13:24,374 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (1/1) ... [2025-02-07 17:13:24,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:13:24,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:24,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 17:13:24,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 17:13:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 17:13:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 17:13:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 17:13:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 17:13:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 17:13:24,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 17:13:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:13:24,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:13:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 17:13:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 17:13:24,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 17:13:24,457 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:13:24,459 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:13:24,563 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L44: call ULTIMATE.dealloc(main_~#array~0#1.base, main_~#array~0#1.offset);havoc main_~#array~0#1.base, main_~#array~0#1.offset; [2025-02-07 17:13:24,568 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-02-07 17:13:24,568 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:13:24,573 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:13:24,573 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:13:24,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:13:24 BoogieIcfgContainer [2025-02-07 17:13:24,575 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:13:24,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:13:24,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:13:24,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:13:24,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:13:24" (1/3) ... [2025-02-07 17:13:24,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216edbf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:13:24, skipping insertion in model container [2025-02-07 17:13:24,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:13:24" (2/3) ... [2025-02-07 17:13:24,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216edbf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:13:24, skipping insertion in model container [2025-02-07 17:13:24,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:13:24" (3/3) ... [2025-02-07 17:13:24,580 INFO L128 eAbstractionObserver]: Analyzing ICFG array27_pattern.c [2025-02-07 17:13:24,589 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:13:24,590 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array27_pattern.c that has 1 procedures, 16 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-02-07 17:13:24,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:13:24,628 INFO L333 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, 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;@424a3758, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:13:24,629 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:13:24,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:24,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 17:13:24,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:24,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:24,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:24,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:24,638 INFO L85 PathProgramCache]: Analyzing trace with hash 383550127, now seen corresponding path program 1 times [2025-02-07 17:13:24,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:24,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074632230] [2025-02-07 17:13:24,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:24,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:24,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 17:13:24,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 17:13:24,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:24,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:13:24,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:24,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074632230] [2025-02-07 17:13:24,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074632230] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:13:24,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:13:24,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 17:13:24,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130521306] [2025-02-07 17:13:24,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:13:24,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 17:13:24,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:24,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 17:13:24,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 17:13:24,761 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:24,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:24,769 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2025-02-07 17:13:24,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 17:13:24,770 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 17:13:24,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:24,774 INFO L225 Difference]: With dead ends: 30 [2025-02-07 17:13:24,774 INFO L226 Difference]: Without dead ends: 12 [2025-02-07 17:13:24,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 17:13:24,778 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:24,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:13:24,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-02-07 17:13:24,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-02-07 17:13:24,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:24,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2025-02-07 17:13:24,807 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 7 [2025-02-07 17:13:24,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:24,808 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2025-02-07 17:13:24,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:24,808 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2025-02-07 17:13:24,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-07 17:13:24,809 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:24,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:24,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 17:13:24,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:24,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:24,810 INFO L85 PathProgramCache]: Analyzing trace with hash 412179278, now seen corresponding path program 1 times [2025-02-07 17:13:24,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:24,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779626965] [2025-02-07 17:13:24,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:24,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:24,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-07 17:13:24,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-07 17:13:24,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:24,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:13:24,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:24,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779626965] [2025-02-07 17:13:24,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779626965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:13:24,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:13:24,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:13:24,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984583315] [2025-02-07 17:13:24,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:13:24,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 17:13:24,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:24,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 17:13:24,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:13:24,984 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:25,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:25,035 INFO L93 Difference]: Finished difference Result 23 states and 33 transitions. [2025-02-07 17:13:25,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 17:13:25,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-07 17:13:25,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:25,036 INFO L225 Difference]: With dead ends: 23 [2025-02-07 17:13:25,036 INFO L226 Difference]: Without dead ends: 18 [2025-02-07 17:13:25,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-07 17:13:25,037 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 51 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:25,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 7 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:13:25,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-07 17:13:25,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2025-02-07 17:13:25,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2025-02-07 17:13:25,042 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 7 [2025-02-07 17:13:25,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:25,042 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-02-07 17:13:25,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2025-02-07 17:13:25,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 17:13:25,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:25,042 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:25,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 17:13:25,043 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:25,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:25,043 INFO L85 PathProgramCache]: Analyzing trace with hash -250408789, now seen corresponding path program 1 times [2025-02-07 17:13:25,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:25,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591950291] [2025-02-07 17:13:25,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:25,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:25,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 17:13:25,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 17:13:25,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:25,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:13:25,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:25,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591950291] [2025-02-07 17:13:25,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591950291] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:13:25,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:13:25,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:13:25,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819517799] [2025-02-07 17:13:25,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:13:25,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:13:25,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:25,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:13:25,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:13:25,146 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:25,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:25,184 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2025-02-07 17:13:25,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:13:25,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-07 17:13:25,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:25,185 INFO L225 Difference]: With dead ends: 32 [2025-02-07 17:13:25,185 INFO L226 Difference]: Without dead ends: 22 [2025-02-07 17:13:25,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:13:25,186 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 12 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:25,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 12 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:13:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-07 17:13:25,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2025-02-07 17:13:25,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-02-07 17:13:25,189 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 11 [2025-02-07 17:13:25,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:25,189 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-02-07 17:13:25,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:25,189 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-02-07 17:13:25,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 17:13:25,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:25,190 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:25,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 17:13:25,190 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:25,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:25,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2086554163, now seen corresponding path program 1 times [2025-02-07 17:13:25,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:25,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676459754] [2025-02-07 17:13:25,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:25,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:25,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 17:13:25,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 17:13:25,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:25,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 17:13:25,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2047630867] [2025-02-07 17:13:25,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:25,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:25,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:25,208 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:13:25,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-07 17:13:25,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 17:13:25,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 17:13:25,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:25,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:25,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-07 17:13:25,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:25,315 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 11 treesize of output 7 [2025-02-07 17:13:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:13:25,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:25,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2025-02-07 17:13:25,693 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 55 treesize of output 53 [2025-02-07 17:13:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:13:25,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:25,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676459754] [2025-02-07 17:13:25,820 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 17:13:25,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047630867] [2025-02-07 17:13:25,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047630867] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:25,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 17:13:25,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2025-02-07 17:13:25,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985751740] [2025-02-07 17:13:25,820 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:25,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-07 17:13:25,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:25,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-07 17:13:25,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-02-07 17:13:25,821 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:27,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:27,094 INFO L93 Difference]: Finished difference Result 72 states and 108 transitions. [2025-02-07 17:13:27,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-02-07 17:13:27,094 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-07 17:13:27,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:27,096 INFO L225 Difference]: With dead ends: 72 [2025-02-07 17:13:27,096 INFO L226 Difference]: Without dead ends: 60 [2025-02-07 17:13:27,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=528, Invalid=1364, Unknown=0, NotChecked=0, Total=1892 [2025-02-07 17:13:27,097 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 120 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:27,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 33 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 17:13:27,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-07 17:13:27,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 41. [2025-02-07 17:13:27,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.45) internal successors, (58), 40 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2025-02-07 17:13:27,108 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 15 [2025-02-07 17:13:27,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:27,109 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2025-02-07 17:13:27,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:27,109 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2025-02-07 17:13:27,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-07 17:13:27,109 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:27,109 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:27,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 17:13:27,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:27,314 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:27,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:27,314 INFO L85 PathProgramCache]: Analyzing trace with hash -257714343, now seen corresponding path program 2 times [2025-02-07 17:13:27,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:27,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15937412] [2025-02-07 17:13:27,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:13:27,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:27,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-07 17:13:27,332 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-07 17:13:27,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:13:27,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:27,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-07 17:13:27,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:27,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15937412] [2025-02-07 17:13:27,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15937412] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:27,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940139355] [2025-02-07 17:13:27,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:13:27,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:27,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:27,399 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:13:27,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-07 17:13:27,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-07 17:13:27,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-07 17:13:27,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:13:27,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:27,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 17:13:27,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:27,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:13:27,503 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:27,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:13:27,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940139355] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:27,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:27,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-07 17:13:27,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562175088] [2025-02-07 17:13:27,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:27,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 17:13:27,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:27,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 17:13:27,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-07 17:13:27,538 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:27,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:27,768 INFO L93 Difference]: Finished difference Result 131 states and 199 transitions. [2025-02-07 17:13:27,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-07 17:13:27,768 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-07 17:13:27,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:27,769 INFO L225 Difference]: With dead ends: 131 [2025-02-07 17:13:27,769 INFO L226 Difference]: Without dead ends: 90 [2025-02-07 17:13:27,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2025-02-07 17:13:27,769 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 55 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:27,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 30 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:13:27,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-07 17:13:27,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2025-02-07 17:13:27,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 60 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:27,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 89 transitions. [2025-02-07 17:13:27,807 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 89 transitions. Word has length 16 [2025-02-07 17:13:27,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:27,808 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 89 transitions. [2025-02-07 17:13:27,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:27,808 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 89 transitions. [2025-02-07 17:13:27,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-07 17:13:27,808 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:27,808 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:27,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 17:13:28,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:28,013 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:28,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:28,014 INFO L85 PathProgramCache]: Analyzing trace with hash 399661372, now seen corresponding path program 1 times [2025-02-07 17:13:28,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:28,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981672960] [2025-02-07 17:13:28,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:28,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:28,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-07 17:13:28,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 17:13:28,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:28,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-07 17:13:28,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:28,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981672960] [2025-02-07 17:13:28,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981672960] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:28,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613667277] [2025-02-07 17:13:28,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:13:28,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:28,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:28,097 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:13:28,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-07 17:13:28,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-07 17:13:28,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-07 17:13:28,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:13:28,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:28,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 17:13:28,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-07 17:13:28,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:28,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-07 17:13:28,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613667277] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:28,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:28,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2025-02-07 17:13:28,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243513284] [2025-02-07 17:13:28,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:28,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-07 17:13:28,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:28,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-07 17:13:28,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-02-07 17:13:28,259 INFO L87 Difference]: Start difference. First operand 61 states and 89 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:28,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:28,560 INFO L93 Difference]: Finished difference Result 160 states and 245 transitions. [2025-02-07 17:13:28,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-07 17:13:28,560 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-07 17:13:28,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:28,561 INFO L225 Difference]: With dead ends: 160 [2025-02-07 17:13:28,561 INFO L226 Difference]: Without dead ends: 105 [2025-02-07 17:13:28,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2025-02-07 17:13:28,562 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 63 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:28,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 24 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:13:28,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-02-07 17:13:28,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 92. [2025-02-07 17:13:28,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:28,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 126 transitions. [2025-02-07 17:13:28,612 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 126 transitions. Word has length 20 [2025-02-07 17:13:28,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:28,612 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 126 transitions. [2025-02-07 17:13:28,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 15 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:28,613 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 126 transitions. [2025-02-07 17:13:28,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-07 17:13:28,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:28,613 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:28,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 17:13:28,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:28,814 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:28,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:28,815 INFO L85 PathProgramCache]: Analyzing trace with hash 143016095, now seen corresponding path program 2 times [2025-02-07 17:13:28,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:28,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440817139] [2025-02-07 17:13:28,815 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:13:28,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:28,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-07 17:13:28,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 17:13:28,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:13:28,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:28,888 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-07 17:13:28,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:28,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440817139] [2025-02-07 17:13:28,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440817139] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:28,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130910185] [2025-02-07 17:13:28,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:13:28,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:28,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:28,893 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:13:28,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 17:13:28,921 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-02-07 17:13:28,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-02-07 17:13:28,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:13:28,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:28,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 17:13:28,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-07 17:13:28,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:29,014 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-07 17:13:29,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130910185] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:29,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:29,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-02-07 17:13:29,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395354530] [2025-02-07 17:13:29,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:29,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 17:13:29,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:29,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 17:13:29,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-07 17:13:29,016 INFO L87 Difference]: Start difference. First operand 92 states and 126 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:29,193 INFO L93 Difference]: Finished difference Result 100 states and 134 transitions. [2025-02-07 17:13:29,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-07 17:13:29,193 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-02-07 17:13:29,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:29,193 INFO L225 Difference]: With dead ends: 100 [2025-02-07 17:13:29,193 INFO L226 Difference]: Without dead ends: 75 [2025-02-07 17:13:29,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=0, NotChecked=0, Total=552 [2025-02-07 17:13:29,194 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 45 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:29,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 28 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:13:29,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-07 17:13:29,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 48. [2025-02-07 17:13:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.297872340425532) internal successors, (61), 47 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:29,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2025-02-07 17:13:29,212 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 26 [2025-02-07 17:13:29,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:29,212 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2025-02-07 17:13:29,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:29,212 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2025-02-07 17:13:29,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-07 17:13:29,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:29,213 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:29,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 17:13:29,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-07 17:13:29,417 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:29,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:29,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1368233175, now seen corresponding path program 3 times [2025-02-07 17:13:29,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:29,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152562970] [2025-02-07 17:13:29,417 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:13:29,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:29,423 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 6 equivalence classes. [2025-02-07 17:13:29,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 17:13:29,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-07 17:13:29,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-07 17:13:29,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:13:29,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152562970] [2025-02-07 17:13:29,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152562970] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:13:29,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819833516] [2025-02-07 17:13:29,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:13:29,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:29,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:29,571 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:13:29,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 17:13:29,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 6 equivalence classes. [2025-02-07 17:13:29,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 17:13:29,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-07 17:13:29,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:29,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 17:13:29,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 17:13:29,839 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 17:13:29,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819833516] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:13:29,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:13:29,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 23 [2025-02-07 17:13:29,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672941601] [2025-02-07 17:13:29,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:13:29,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 17:13:29,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:13:29,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 17:13:29,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2025-02-07 17:13:29,977 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:30,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:13:30,588 INFO L93 Difference]: Finished difference Result 140 states and 182 transitions. [2025-02-07 17:13:30,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-07 17:13:30,588 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-07 17:13:30,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:13:30,588 INFO L225 Difference]: With dead ends: 140 [2025-02-07 17:13:30,588 INFO L226 Difference]: Without dead ends: 82 [2025-02-07 17:13:30,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 838 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=707, Invalid=2155, Unknown=0, NotChecked=0, Total=2862 [2025-02-07 17:13:30,590 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 83 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:13:30,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 35 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:13:30,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-07 17:13:30,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 59. [2025-02-07 17:13:30,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 58 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:30,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2025-02-07 17:13:30,617 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 31 [2025-02-07 17:13:30,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:13:30,617 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2025-02-07 17:13:30,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:13:30,617 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2025-02-07 17:13:30,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-07 17:13:30,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:13:30,618 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:13:30,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-07 17:13:30,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:30,819 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:13:30,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:13:30,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1419182312, now seen corresponding path program 4 times [2025-02-07 17:13:30,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:13:30,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574201926] [2025-02-07 17:13:30,820 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:13:30,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:13:30,830 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-02-07 17:13:30,847 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 17:13:30,850 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 17:13:30,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 17:13:30,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1956940874] [2025-02-07 17:13:30,851 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:13:30,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:13:30,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:13:30,853 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:13:30,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-07 17:13:30,885 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-02-07 17:13:30,932 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-07 17:13:30,932 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 17:13:30,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:13:30,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-02-07 17:13:30,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:13:30,967 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 11 treesize of output 7 [2025-02-07 17:13:31,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-02-07 17:13:31,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:31,183 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 26 treesize of output 28 [2025-02-07 17:13:31,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:31,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-02-07 17:13:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:13:31,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:13:33,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 303 treesize of output 295 [2025-02-07 17:13:36,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:13:36,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 26245005552 treesize of output 25573916952 [2025-02-07 17:13:57,269 WARN L286 SmtUtils]: Spent 20.40s on a formula simplification. DAG size of input: 4877 DAG size of output: 841 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-07 17:14:13,470 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:13,562 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:13,617 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:13,662 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:13,761 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:13,817 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:13,862 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:13,904 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:13,975 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:14,232 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:14,273 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:14,309 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:14,448 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:14,477 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:14,493 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:14,512 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:14,542 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:14,560 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:14,596 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:14,613 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:14,631 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:14,663 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:14,683 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:14,709 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:14,726 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:14,744 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:14,773 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:14,792 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:14,816 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:14,896 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:14,936 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:14,954 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:14,974 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:14,992 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:15,022 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:15,139 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:15,193 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:15,237 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:15,250 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:15,268 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:15,292 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:15,323 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:15,388 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:15,445 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:15,460 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:15,493 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:15,529 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:15,563 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:15,702 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:15,744 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:15,766 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:15,784 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:15,815 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:15,834 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:15,848 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:15,868 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:15,894 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:15,926 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:15,995 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:16,025 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:16,108 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:16,150 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:16,159 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:16,200 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:16,231 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:16,296 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:16,325 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:16,346 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:16,362 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:16,378 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:16,406 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:16,426 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:16,434 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:16,471 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:16,490 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:16,517 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:16,548 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:16,611 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:16,688 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:16,716 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:16,745 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:16,774 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:16,788 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:16,807 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:16,835 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:16,876 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:16,921 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:16,973 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:17,014 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:17,027 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:17,044 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:17,065 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:17,105 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:17,169 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:17,220 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:17,235 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:17,251 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:17,267 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:17,296 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:17,383 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:17,412 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:17,421 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:17,502 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:17,518 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:17,530 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:17,551 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:17,565 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:17,633 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:17,659 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:17,685 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:17,752 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:17,785 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:17,818 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:17,836 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:17,903 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:17,969 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:18,044 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:18,073 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:18,085 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:18,105 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:18,118 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:18,186 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:18,211 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:18,236 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:18,302 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:18,335 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:18,367 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:18,386 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:18,458 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:18,519 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:19,425 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:19,546 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:19,584 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:19,625 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:19,705 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:19,777 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:19,929 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:20,287 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:20,441 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:20,484 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:20,500 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:20,570 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:20,592 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:20,634 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:20,665 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:20,738 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:20,890 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:21,245 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:21,412 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:21,446 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:21,511 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:21,520 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:21,614 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:21,645 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:21,715 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:21,867 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:22,231 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:22,384 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:22,413 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:22,479 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:22,546 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:22,563 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:22,633 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:22,683 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:22,697 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:22,750 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:22,906 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:23,269 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-02-07 17:14:24,100 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:24,447 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:24,515 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:24,680 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:24,830 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:24,907 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:24,970 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:25,008 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:25,025 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:25,060 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:25,087 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:25,155 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:25,175 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:25,194 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:25,225 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:25,253 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:25,262 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:25,287 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:25,305 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:25,335 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:25,349 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:25,368 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:25,435 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:25,460 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:25,501 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:25,532 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:25,576 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:25,621 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:25,654 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:25,797 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:25,811 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:25,833 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:25,848 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:25,895 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:26,005 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:26,160 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:26,514 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-02-07 17:14:27,347 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:27,702 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:27,771 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:27,937 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:28,088 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:28,156 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:28,220 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:28,258 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:28,287 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:28,365 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:28,396 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:28,424 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:28,501 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:28,583 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:28,618 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:28,648 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:28,667 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:28,685 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:28,721 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:28,750 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:28,822 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:28,852 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:28,867 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:28,887 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:28,912 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:28,934 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:28,990 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:29,146 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:29,509 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-02-07 17:14:30,344 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:30,692 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:30,755 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:30,909 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:30,982 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:31,004 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:31,045 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:31,127 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:31,214 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:31,368 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:31,725 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:31,879 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:31,914 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:31,941 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:31,972 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:31,983 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:32,012 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:32,026 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:32,069 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:32,093 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:32,141 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:32,222 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:32,295 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:32,447 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:32,802 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:32,956 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:32,991 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:33,015 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:33,078 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:33,100 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:33,142 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:33,178 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:33,251 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:33,403 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:33,759 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:33,922 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:33,955 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:34,021 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:34,031 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:34,126 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:34,158 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:34,232 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:34,400 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:34,763 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:34,917 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:34,973 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:35,042 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:35,108 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:35,125 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:35,196 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:35,247 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:35,262 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:35,313 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:35,469 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:35,832 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-02-07 17:14:36,660 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:37,007 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:37,076 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:37,240 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:37,391 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:37,467 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:37,531 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:37,571 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:37,589 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:37,624 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:37,653 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:37,723 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:37,743 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:37,761 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:37,791 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:37,810 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:37,819 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:37,843 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:37,861 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:37,890 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:37,905 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:37,925 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:37,957 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:37,970 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:37,991 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:38,006 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:38,040 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:38,081 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:38,118 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:38,252 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:38,266 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:38,288 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:38,304 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:38,339 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:38,393 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:38,435 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:38,450 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:38,479 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:38,499 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:38,516 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:38,531 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:38,559 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:38,579 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:14:38,706 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:38,728 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:38,765 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:38,794 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:38,857 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:38,917 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:38,946 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:39,009 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:39,174 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-02-07 17:14:39,986 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-02-07 17:14:41,884 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-02-07 17:14:42,708 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:43,046 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:43,400 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:43,469 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:43,614 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:43,954 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:44,100 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:44,168 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:44,212 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:44,276 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:44,418 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:44,484 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:44,528 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:44,559 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:44,707 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:44,785 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:44,871 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:44,923 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:45,269 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-02-07 17:14:46,090 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:46,438 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:46,587 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:46,655 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:46,815 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:46,852 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:46,874 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:46,903 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:46,986 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:47,029 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:47,114 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:47,163 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:47,507 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-02-07 17:14:48,322 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:48,666 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:48,815 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:48,891 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:49,040 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:14:49,152 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:49,181 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:49,262 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:49,291 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:49,378 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:49,736 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:50,083 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-02-07 17:14:50,907 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:51,062 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:51,212 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:51,279 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:51,425 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:51,527 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:51,562 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:14:51,591 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:51,723 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:51,793 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:51,858 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:52,011 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:52,082 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:14:52,146 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:52,325 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:52,681 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-02-07 17:14:54,591 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-02-07 17:14:55,411 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-02-07 17:14:56,217 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:56,578 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:56,724 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:57,070 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:14:57,229 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:14:57,578 WARN L672 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2025-02-07 17:14:59,477 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-02-07 17:15:00,297 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2025-02-07 17:15:01,096 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:15:01,457 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:15:01,604 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:15:01,946 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:15:02,108 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:15:02,170 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:15:02,232 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:15:02,390 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:02,421 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:15:02,569 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:15:02,640 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:02,667 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:15:02,752 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:02,785 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:02,800 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:02,819 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:02,837 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:02,874 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:02,909 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:15:03,007 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:03,038 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:15:03,103 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:15:03,248 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:15:03,315 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:03,344 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:03,402 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:03,431 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:15:03,516 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:15:03,581 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:15:03,724 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:15:03,792 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:03,820 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:03,853 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:15:03,923 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:15:04,066 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:15:04,407 WARN L672 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2025-02-07 17:15:04,551 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:04,578 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:04,613 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:04,628 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:04,656 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:04,694 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:04,710 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:04,727 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:04,757 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:04,794 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:04,812 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:04,847 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:04,862 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:15:04,876 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:04,902 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:04,940 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:04,970 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:15:05,039 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:05,078 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:15:05,094 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:05,125 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:05,141 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:05,165 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:15:05,181 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:05,212 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:05,228 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:05,254 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:15:05,265 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:15:05,283 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:15:05,301 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:15:05,312 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:05,377 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:15:05,402 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:05,427 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:05,458 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:05,486 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:15:05,558 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:05,582 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:05,614 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:05,659 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:15:05,729 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:05,764 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:05,783 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:05,801 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:05,838 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:05,867 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-02-07 17:15:05,935 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:15:05,948 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:15:05,961 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-02-07 17:15:06,097 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-02-07 17:15:06,120 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-02-07 17:15:06,190 WARN L672 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2025-02-07 17:15:06,552 WARN L672 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts.