./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-72.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 f1d9b1e41dffeaea131d798bbdfd7596d256be5a23994dc1bad36ef03f5ad100 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 04:53:23,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 04:53:23,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 04:53:23,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 04:53:23,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 04:53:23,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 04:53:23,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 04:53:23,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 04:53:23,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 04:53:23,982 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 04:53:23,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 04:53:23,982 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 04:53:23,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 04:53:23,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 04:53:23,983 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 04:53:23,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 04:53:23,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 04:53:23,983 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 04:53:23,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 04:53:23,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 04:53:23,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 04:53:23,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 04:53:23,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 04:53:23,983 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 04:53:23,983 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 04:53:23,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 04:53:23,983 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 04:53:23,983 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 04:53:23,983 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 04:53:23,984 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 04:53:23,984 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 04:53:23,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 04:53:23,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:53:23,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 04:53:23,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 04:53:23,984 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 04:53:23,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 04:53:23,984 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 04:53:23,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 04:53:23,984 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 04:53:23,984 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 04:53:23,984 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 04:53:23,984 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 04:53:23,984 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/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 -> f1d9b1e41dffeaea131d798bbdfd7596d256be5a23994dc1bad36ef03f5ad100 [2025-03-17 04:53:24,227 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 04:53:24,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 04:53:24,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 04:53:24,237 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 04:53:24,237 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 04:53:24,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-72.i [2025-03-17 04:53:25,432 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0990ace7d/5e6cdcb556fe46f3a5440e795fadf179/FLAGc7f4487b8 [2025-03-17 04:53:25,730 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 04:53:25,731 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-72.i [2025-03-17 04:53:25,744 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0990ace7d/5e6cdcb556fe46f3a5440e795fadf179/FLAGc7f4487b8 [2025-03-17 04:53:25,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0990ace7d/5e6cdcb556fe46f3a5440e795fadf179 [2025-03-17 04:53:25,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 04:53:25,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 04:53:25,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 04:53:25,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 04:53:25,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 04:53:25,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:53:25" (1/1) ... [2025-03-17 04:53:25,777 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1509a06a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:53:25, skipping insertion in model container [2025-03-17 04:53:25,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 04:53:25" (1/1) ... [2025-03-17 04:53:25,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 04:53:25,925 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-72.i[916,929] [2025-03-17 04:53:26,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:53:26,111 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 04:53:26,120 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-72.i[916,929] [2025-03-17 04:53:26,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 04:53:26,225 INFO L204 MainTranslator]: Completed translation [2025-03-17 04:53:26,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:53:26 WrapperNode [2025-03-17 04:53:26,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 04:53:26,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 04:53:26,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 04:53:26,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 04:53:26,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:53:26" (1/1) ... [2025-03-17 04:53:26,254 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:53:26" (1/1) ... [2025-03-17 04:53:26,317 INFO L138 Inliner]: procedures = 26, calls = 76, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 633 [2025-03-17 04:53:26,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 04:53:26,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 04:53:26,318 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 04:53:26,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 04:53:26,326 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:53:26" (1/1) ... [2025-03-17 04:53:26,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:53:26" (1/1) ... [2025-03-17 04:53:26,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:53:26" (1/1) ... [2025-03-17 04:53:26,427 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 04:53:26,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:53:26" (1/1) ... [2025-03-17 04:53:26,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:53:26" (1/1) ... [2025-03-17 04:53:26,458 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:53:26" (1/1) ... [2025-03-17 04:53:26,463 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:53:26" (1/1) ... [2025-03-17 04:53:26,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:53:26" (1/1) ... [2025-03-17 04:53:26,480 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:53:26" (1/1) ... [2025-03-17 04:53:26,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 04:53:26,495 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 04:53:26,495 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 04:53:26,495 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 04:53:26,496 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:53:26" (1/1) ... [2025-03-17 04:53:26,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 04:53:26,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:53:26,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 04:53:26,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 04:53:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 04:53:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 04:53:26,548 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 04:53:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 04:53:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 04:53:26,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 04:53:26,659 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 04:53:26,661 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 04:53:27,494 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L634: havoc property_#t~ite42#1;havoc property_#t~bitwise41#1;havoc property_#t~short43#1;havoc property_#t~bitwise44#1;havoc property_#t~short45#1;havoc property_#t~bitwise46#1;havoc property_#t~short47#1; [2025-03-17 04:53:27,618 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2025-03-17 04:53:27,619 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 04:53:27,645 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 04:53:27,645 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 04:53:27,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:53:27 BoogieIcfgContainer [2025-03-17 04:53:27,646 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 04:53:27,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 04:53:27,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 04:53:27,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 04:53:27,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 04:53:25" (1/3) ... [2025-03-17 04:53:27,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d74e578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:53:27, skipping insertion in model container [2025-03-17 04:53:27,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 04:53:26" (2/3) ... [2025-03-17 04:53:27,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d74e578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 04:53:27, skipping insertion in model container [2025-03-17 04:53:27,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 04:53:27" (3/3) ... [2025-03-17 04:53:27,654 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-72.i [2025-03-17 04:53:27,666 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 04:53:27,669 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-72.i that has 2 procedures, 253 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 04:53:27,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 04:53:27,733 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;@5e64e3e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 04:53:27,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 04:53:27,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 253 states, 187 states have (on average 1.5775401069518717) internal successors, (295), 188 states have internal predecessors, (295), 63 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-17 04:53:27,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-17 04:53:27,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:53:27,754 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:53:27,755 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:53:27,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:53:27,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1706662126, now seen corresponding path program 1 times [2025-03-17 04:53:27,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:53:27,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275843632] [2025-03-17 04:53:27,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:27,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:53:27,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-17 04:53:27,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-17 04:53:27,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:27,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:28,326 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 124 refuted. 0 times theorem prover too weak. 7688 trivial. 0 not checked. [2025-03-17 04:53:28,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:53:28,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275843632] [2025-03-17 04:53:28,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275843632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:53:28,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891593875] [2025-03-17 04:53:28,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:28,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:53:28,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:53:28,332 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:53:28,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 04:53:28,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-17 04:53:28,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-17 04:53:28,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:28,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:28,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 04:53:28,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:53:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 7688 trivial. 0 not checked. [2025-03-17 04:53:28,688 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 04:53:28,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891593875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:53:28,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 04:53:28,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 04:53:28,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462628470] [2025-03-17 04:53:28,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:53:28,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 04:53:28,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:53:28,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 04:53:28,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 04:53:28,716 INFO L87 Difference]: Start difference. First operand has 253 states, 187 states have (on average 1.5775401069518717) internal successors, (295), 188 states have internal predecessors, (295), 63 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) Second operand has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 2 states have call successors, (63), 2 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 2 states have call successors, (63) [2025-03-17 04:53:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:53:28,785 INFO L93 Difference]: Finished difference Result 503 states and 903 transitions. [2025-03-17 04:53:28,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 04:53:28,789 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 2 states have call successors, (63), 2 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 2 states have call successors, (63) Word has length 439 [2025-03-17 04:53:28,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:53:28,795 INFO L225 Difference]: With dead ends: 503 [2025-03-17 04:53:28,795 INFO L226 Difference]: Without dead ends: 251 [2025-03-17 04:53:28,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 440 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-03-17 04:53:28,806 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 04:53:28,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 411 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 04:53:28,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-17 04:53:28,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2025-03-17 04:53:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 186 states have (on average 1.564516129032258) internal successors, (291), 186 states have internal predecessors, (291), 63 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-17 04:53:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 417 transitions. [2025-03-17 04:53:28,867 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 417 transitions. Word has length 439 [2025-03-17 04:53:28,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:53:28,867 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 417 transitions. [2025-03-17 04:53:28,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 2 states have call successors, (63), 2 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 2 states have call successors, (63) [2025-03-17 04:53:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 417 transitions. [2025-03-17 04:53:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-17 04:53:28,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:53:28,879 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:53:28,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 04:53:29,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 04:53:29,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:53:29,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:53:29,084 INFO L85 PathProgramCache]: Analyzing trace with hash 2025894553, now seen corresponding path program 1 times [2025-03-17 04:53:29,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:53:29,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543103771] [2025-03-17 04:53:29,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:29,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:53:29,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-17 04:53:29,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-17 04:53:29,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:29,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-17 04:53:29,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:53:29,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543103771] [2025-03-17 04:53:29,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543103771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:53:29,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:53:29,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:53:29,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442832947] [2025-03-17 04:53:29,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:53:29,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:53:29,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:53:29,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:53:29,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:53:29,551 INFO L87 Difference]: Start difference. First operand 251 states and 417 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:29,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:53:29,656 INFO L93 Difference]: Finished difference Result 748 states and 1243 transitions. [2025-03-17 04:53:29,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:53:29,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 439 [2025-03-17 04:53:29,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:53:29,662 INFO L225 Difference]: With dead ends: 748 [2025-03-17 04:53:29,662 INFO L226 Difference]: Without dead ends: 498 [2025-03-17 04:53:29,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:53:29,664 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 397 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:53:29,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 832 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:53:29,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-03-17 04:53:29,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 272. [2025-03-17 04:53:29,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 207 states have (on average 1.570048309178744) internal successors, (325), 207 states have internal predecessors, (325), 63 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-17 04:53:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 451 transitions. [2025-03-17 04:53:29,709 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 451 transitions. Word has length 439 [2025-03-17 04:53:29,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:53:29,712 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 451 transitions. [2025-03-17 04:53:29,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:29,713 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 451 transitions. [2025-03-17 04:53:29,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-17 04:53:29,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:53:29,732 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:53:29,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 04:53:29,732 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:53:29,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:53:29,734 INFO L85 PathProgramCache]: Analyzing trace with hash -344717797, now seen corresponding path program 1 times [2025-03-17 04:53:29,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:53:29,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802936059] [2025-03-17 04:53:29,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:29,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:53:29,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-17 04:53:29,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-17 04:53:29,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:29,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:30,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-17 04:53:30,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:53:30,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802936059] [2025-03-17 04:53:30,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802936059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:53:30,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:53:30,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:53:30,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489424372] [2025-03-17 04:53:30,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:53:30,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:53:30,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:53:30,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:53:30,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:53:30,405 INFO L87 Difference]: Start difference. First operand 272 states and 451 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:30,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:53:30,838 INFO L93 Difference]: Finished difference Result 973 states and 1619 transitions. [2025-03-17 04:53:30,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:53:30,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 439 [2025-03-17 04:53:30,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:53:30,846 INFO L225 Difference]: With dead ends: 973 [2025-03-17 04:53:30,846 INFO L226 Difference]: Without dead ends: 702 [2025-03-17 04:53:30,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:53:30,850 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 528 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 2047 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:53:30,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 2047 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:53:30,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2025-03-17 04:53:30,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 545. [2025-03-17 04:53:30,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 416 states have (on average 1.5673076923076923) internal successors, (652), 416 states have internal predecessors, (652), 126 states have call successors, (126), 2 states have call predecessors, (126), 2 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-17 04:53:30,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 904 transitions. [2025-03-17 04:53:30,907 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 904 transitions. Word has length 439 [2025-03-17 04:53:30,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:53:30,910 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 904 transitions. [2025-03-17 04:53:30,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 904 transitions. [2025-03-17 04:53:30,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-03-17 04:53:30,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:53:30,916 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:53:30,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 04:53:30,917 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:53:30,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:53:30,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1719086300, now seen corresponding path program 1 times [2025-03-17 04:53:30,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:53:30,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721969194] [2025-03-17 04:53:30,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:30,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:53:30,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-03-17 04:53:31,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-03-17 04:53:31,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:31,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-17 04:53:31,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:53:31,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721969194] [2025-03-17 04:53:31,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721969194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:53:31,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:53:31,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:53:31,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978990618] [2025-03-17 04:53:31,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:53:31,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:53:31,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:53:31,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:53:31,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:53:31,414 INFO L87 Difference]: Start difference. First operand 545 states and 904 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:31,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:53:31,729 INFO L93 Difference]: Finished difference Result 1518 states and 2523 transitions. [2025-03-17 04:53:31,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:53:31,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 439 [2025-03-17 04:53:31,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:53:31,739 INFO L225 Difference]: With dead ends: 1518 [2025-03-17 04:53:31,740 INFO L226 Difference]: Without dead ends: 974 [2025-03-17 04:53:31,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:53:31,742 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 445 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:53:31,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1218 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:53:31,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-17 04:53:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 651. [2025-03-17 04:53:31,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 458 states have (on average 1.519650655021834) internal successors, (696), 458 states have internal predecessors, (696), 189 states have call successors, (189), 3 states have call predecessors, (189), 3 states have return successors, (189), 189 states have call predecessors, (189), 189 states have call successors, (189) [2025-03-17 04:53:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 1074 transitions. [2025-03-17 04:53:31,817 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 1074 transitions. Word has length 439 [2025-03-17 04:53:31,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:53:31,817 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 1074 transitions. [2025-03-17 04:53:31,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:31,818 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 1074 transitions. [2025-03-17 04:53:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-03-17 04:53:31,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:53:31,825 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:53:31,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 04:53:31,825 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:53:31,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:53:31,826 INFO L85 PathProgramCache]: Analyzing trace with hash 612602079, now seen corresponding path program 1 times [2025-03-17 04:53:31,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:53:31,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165509896] [2025-03-17 04:53:31,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:31,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:53:31,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-17 04:53:31,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-17 04:53:31,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:31,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:32,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-17 04:53:32,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:53:32,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165509896] [2025-03-17 04:53:32,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165509896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:53:32,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:53:32,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:53:32,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588844880] [2025-03-17 04:53:32,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:53:32,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:53:32,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:53:32,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:53:32,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:53:32,545 INFO L87 Difference]: Start difference. First operand 651 states and 1074 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:32,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:53:32,840 INFO L93 Difference]: Finished difference Result 1518 states and 2522 transitions. [2025-03-17 04:53:32,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:53:32,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 440 [2025-03-17 04:53:32,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:53:32,846 INFO L225 Difference]: With dead ends: 1518 [2025-03-17 04:53:32,846 INFO L226 Difference]: Without dead ends: 974 [2025-03-17 04:53:32,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:53:32,849 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 297 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:53:32,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 1209 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:53:32,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2025-03-17 04:53:32,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 672. [2025-03-17 04:53:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 479 states have (on average 1.5156576200417538) internal successors, (726), 479 states have internal predecessors, (726), 189 states have call successors, (189), 3 states have call predecessors, (189), 3 states have return successors, (189), 189 states have call predecessors, (189), 189 states have call successors, (189) [2025-03-17 04:53:32,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1104 transitions. [2025-03-17 04:53:32,931 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1104 transitions. Word has length 440 [2025-03-17 04:53:32,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:53:32,931 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 1104 transitions. [2025-03-17 04:53:32,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:32,932 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1104 transitions. [2025-03-17 04:53:32,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-03-17 04:53:32,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:53:32,937 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:53:32,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 04:53:32,937 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:53:32,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:53:32,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1056213502, now seen corresponding path program 1 times [2025-03-17 04:53:32,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:53:32,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983003235] [2025-03-17 04:53:32,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:32,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:53:32,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-17 04:53:33,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-17 04:53:33,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:33,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-17 04:53:33,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:53:33,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983003235] [2025-03-17 04:53:33,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983003235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:53:33,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:53:33,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:53:33,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370919168] [2025-03-17 04:53:33,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:53:33,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:53:33,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:53:33,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:53:33,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:53:33,713 INFO L87 Difference]: Start difference. First operand 672 states and 1104 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:53:34,116 INFO L93 Difference]: Finished difference Result 1804 states and 2954 transitions. [2025-03-17 04:53:34,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:53:34,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 440 [2025-03-17 04:53:34,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:53:34,123 INFO L225 Difference]: With dead ends: 1804 [2025-03-17 04:53:34,123 INFO L226 Difference]: Without dead ends: 1260 [2025-03-17 04:53:34,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:53:34,126 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 396 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:53:34,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1117 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:53:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1260 states. [2025-03-17 04:53:34,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1260 to 1056. [2025-03-17 04:53:34,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 800 states have (on average 1.54875) internal successors, (1239), 802 states have internal predecessors, (1239), 249 states have call successors, (249), 6 states have call predecessors, (249), 6 states have return successors, (249), 247 states have call predecessors, (249), 249 states have call successors, (249) [2025-03-17 04:53:34,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1737 transitions. [2025-03-17 04:53:34,192 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1737 transitions. Word has length 440 [2025-03-17 04:53:34,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:53:34,193 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1737 transitions. [2025-03-17 04:53:34,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1737 transitions. [2025-03-17 04:53:34,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-03-17 04:53:34,198 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:53:34,198 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:53:34,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 04:53:34,199 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:53:34,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:53:34,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1087233309, now seen corresponding path program 1 times [2025-03-17 04:53:34,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:53:34,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293370230] [2025-03-17 04:53:34,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:34,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:53:34,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-17 04:53:34,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-17 04:53:34,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:34,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-17 04:53:34,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:53:34,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293370230] [2025-03-17 04:53:34,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293370230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:53:34,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:53:34,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 04:53:34,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062402514] [2025-03-17 04:53:34,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:53:34,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 04:53:34,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:53:34,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 04:53:34,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:53:34,875 INFO L87 Difference]: Start difference. First operand 1056 states and 1737 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:35,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:53:35,005 INFO L93 Difference]: Finished difference Result 1980 states and 3270 transitions. [2025-03-17 04:53:35,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 04:53:35,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 440 [2025-03-17 04:53:35,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:53:35,016 INFO L225 Difference]: With dead ends: 1980 [2025-03-17 04:53:35,017 INFO L226 Difference]: Without dead ends: 1056 [2025-03-17 04:53:35,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 04:53:35,021 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 0 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:53:35,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 792 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:53:35,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-03-17 04:53:35,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1056. [2025-03-17 04:53:35,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 800 states have (on average 1.54375) internal successors, (1235), 802 states have internal predecessors, (1235), 249 states have call successors, (249), 6 states have call predecessors, (249), 6 states have return successors, (249), 247 states have call predecessors, (249), 249 states have call successors, (249) [2025-03-17 04:53:35,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1733 transitions. [2025-03-17 04:53:35,100 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1733 transitions. Word has length 440 [2025-03-17 04:53:35,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:53:35,101 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1733 transitions. [2025-03-17 04:53:35,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:35,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1733 transitions. [2025-03-17 04:53:35,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-03-17 04:53:35,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:53:35,107 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:53:35,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 04:53:35,107 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:53:35,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:53:35,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1236794530, now seen corresponding path program 1 times [2025-03-17 04:53:35,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:53:35,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520624693] [2025-03-17 04:53:35,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:35,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:53:35,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-17 04:53:35,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-17 04:53:35,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:35,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:36,652 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-17 04:53:36,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:53:36,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520624693] [2025-03-17 04:53:36,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520624693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:53:36,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:53:36,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 04:53:36,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063278584] [2025-03-17 04:53:36,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:53:36,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 04:53:36,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:53:36,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 04:53:36,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 04:53:36,656 INFO L87 Difference]: Start difference. First operand 1056 states and 1733 transitions. Second operand has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 2 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2025-03-17 04:53:38,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:53:38,320 INFO L93 Difference]: Finished difference Result 4412 states and 7282 transitions. [2025-03-17 04:53:38,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:53:38,321 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 2 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 440 [2025-03-17 04:53:38,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:53:38,347 INFO L225 Difference]: With dead ends: 4412 [2025-03-17 04:53:38,347 INFO L226 Difference]: Without dead ends: 3488 [2025-03-17 04:53:38,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-17 04:53:38,352 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 2193 mSDsluCounter, 2594 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 804 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2193 SdHoareTripleChecker+Valid, 2972 SdHoareTripleChecker+Invalid, 1492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 804 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:53:38,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2193 Valid, 2972 Invalid, 1492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [804 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 04:53:38,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3488 states. [2025-03-17 04:53:38,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3488 to 2696. [2025-03-17 04:53:38,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2696 states, 2205 states have (on average 1.5909297052154194) internal successors, (3508), 2213 states have internal predecessors, (3508), 475 states have call successors, (475), 15 states have call predecessors, (475), 15 states have return successors, (475), 467 states have call predecessors, (475), 475 states have call successors, (475) [2025-03-17 04:53:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4458 transitions. [2025-03-17 04:53:38,561 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4458 transitions. Word has length 440 [2025-03-17 04:53:38,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:53:38,564 INFO L471 AbstractCegarLoop]: Abstraction has 2696 states and 4458 transitions. [2025-03-17 04:53:38,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 2 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2025-03-17 04:53:38,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4458 transitions. [2025-03-17 04:53:38,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-03-17 04:53:38,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:53:38,570 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:53:38,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 04:53:38,571 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:53:38,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:53:38,571 INFO L85 PathProgramCache]: Analyzing trace with hash 874495839, now seen corresponding path program 1 times [2025-03-17 04:53:38,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:53:38,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975944014] [2025-03-17 04:53:38,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:38,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:53:38,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-17 04:53:39,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-17 04:53:39,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:39,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:39,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-17 04:53:39,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:53:39,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975944014] [2025-03-17 04:53:39,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975944014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:53:39,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:53:39,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:53:39,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684651018] [2025-03-17 04:53:39,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:53:39,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:53:39,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:53:39,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:53:39,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:53:39,556 INFO L87 Difference]: Start difference. First operand 2696 states and 4458 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:39,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:53:39,873 INFO L93 Difference]: Finished difference Result 5274 states and 8722 transitions. [2025-03-17 04:53:39,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:53:39,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 440 [2025-03-17 04:53:39,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:53:39,885 INFO L225 Difference]: With dead ends: 5274 [2025-03-17 04:53:39,885 INFO L226 Difference]: Without dead ends: 2714 [2025-03-17 04:53:39,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-03-17 04:53:39,891 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 695 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:53:39,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 871 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:53:39,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2025-03-17 04:53:39,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2058. [2025-03-17 04:53:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2058 states, 1709 states have (on average 1.6114686951433588) internal successors, (2754), 1711 states have internal predecessors, (2754), 335 states have call successors, (335), 13 states have call predecessors, (335), 13 states have return successors, (335), 333 states have call predecessors, (335), 335 states have call successors, (335) [2025-03-17 04:53:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 3424 transitions. [2025-03-17 04:53:40,011 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 3424 transitions. Word has length 440 [2025-03-17 04:53:40,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:53:40,012 INFO L471 AbstractCegarLoop]: Abstraction has 2058 states and 3424 transitions. [2025-03-17 04:53:40,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:40,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 3424 transitions. [2025-03-17 04:53:40,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-03-17 04:53:40,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:53:40,017 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:53:40,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 04:53:40,018 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:53:40,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:53:40,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1300184258, now seen corresponding path program 1 times [2025-03-17 04:53:40,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:53:40,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833706902] [2025-03-17 04:53:40,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:40,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:53:40,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-17 04:53:40,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-17 04:53:40,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:40,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:41,052 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-17 04:53:41,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:53:41,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833706902] [2025-03-17 04:53:41,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833706902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:53:41,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:53:41,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:53:41,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258834694] [2025-03-17 04:53:41,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:53:41,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:53:41,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:53:41,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:53:41,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:53:41,055 INFO L87 Difference]: Start difference. First operand 2058 states and 3424 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:41,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:53:41,288 INFO L93 Difference]: Finished difference Result 5764 states and 9680 transitions. [2025-03-17 04:53:41,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:53:41,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 440 [2025-03-17 04:53:41,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:53:41,305 INFO L225 Difference]: With dead ends: 5764 [2025-03-17 04:53:41,306 INFO L226 Difference]: Without dead ends: 3842 [2025-03-17 04:53:41,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:53:41,313 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 712 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:53:41,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 1262 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:53:41,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3842 states. [2025-03-17 04:53:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3842 to 2276. [2025-03-17 04:53:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2276 states, 1927 states have (on average 1.615983393876492) internal successors, (3114), 1929 states have internal predecessors, (3114), 335 states have call successors, (335), 13 states have call predecessors, (335), 13 states have return successors, (335), 333 states have call predecessors, (335), 335 states have call successors, (335) [2025-03-17 04:53:41,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 3784 transitions. [2025-03-17 04:53:41,432 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 3784 transitions. Word has length 440 [2025-03-17 04:53:41,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:53:41,433 INFO L471 AbstractCegarLoop]: Abstraction has 2276 states and 3784 transitions. [2025-03-17 04:53:41,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 3784 transitions. [2025-03-17 04:53:41,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-03-17 04:53:41,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:53:41,437 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:53:41,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 04:53:41,438 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:53:41,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:53:41,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1307943617, now seen corresponding path program 1 times [2025-03-17 04:53:41,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:53:41,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163397353] [2025-03-17 04:53:41,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:41,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:53:41,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-17 04:53:41,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-17 04:53:41,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:41,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-17 04:53:42,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:53:42,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163397353] [2025-03-17 04:53:42,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163397353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:53:42,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:53:42,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:53:42,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151824251] [2025-03-17 04:53:42,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:53:42,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:53:42,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:53:42,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:53:42,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:53:42,061 INFO L87 Difference]: Start difference. First operand 2276 states and 3784 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:42,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:53:42,282 INFO L93 Difference]: Finished difference Result 5234 states and 8676 transitions. [2025-03-17 04:53:42,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:53:42,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 440 [2025-03-17 04:53:42,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:53:42,296 INFO L225 Difference]: With dead ends: 5234 [2025-03-17 04:53:42,296 INFO L226 Difference]: Without dead ends: 3094 [2025-03-17 04:53:42,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:53:42,302 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 154 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:53:42,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1379 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:53:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2025-03-17 04:53:42,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3086. [2025-03-17 04:53:42,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3086 states, 2695 states have (on average 1.609647495361781) internal successors, (4338), 2703 states have internal predecessors, (4338), 371 states have call successors, (371), 19 states have call predecessors, (371), 19 states have return successors, (371), 363 states have call predecessors, (371), 371 states have call successors, (371) [2025-03-17 04:53:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 5080 transitions. [2025-03-17 04:53:42,437 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 5080 transitions. Word has length 440 [2025-03-17 04:53:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:53:42,438 INFO L471 AbstractCegarLoop]: Abstraction has 3086 states and 5080 transitions. [2025-03-17 04:53:42,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 5080 transitions. [2025-03-17 04:53:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-03-17 04:53:42,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:53:42,448 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:53:42,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 04:53:42,448 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:53:42,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:53:42,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1638425499, now seen corresponding path program 1 times [2025-03-17 04:53:42,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:53:42,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427412499] [2025-03-17 04:53:42,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:42,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:53:42,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-17 04:53:42,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-17 04:53:42,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:42,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:43,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-17 04:53:43,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:53:43,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427412499] [2025-03-17 04:53:43,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427412499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:53:43,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:53:43,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:53:43,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852662732] [2025-03-17 04:53:43,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:53:43,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:53:43,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:53:43,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:53:43,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:53:43,132 INFO L87 Difference]: Start difference. First operand 3086 states and 5080 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:53:43,472 INFO L93 Difference]: Finished difference Result 7526 states and 12330 transitions. [2025-03-17 04:53:43,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:53:43,472 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 440 [2025-03-17 04:53:43,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:53:43,499 INFO L225 Difference]: With dead ends: 7526 [2025-03-17 04:53:43,501 INFO L226 Difference]: Without dead ends: 4576 [2025-03-17 04:53:43,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-03-17 04:53:43,507 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 328 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:53:43,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1291 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:53:43,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states. [2025-03-17 04:53:43,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 3086. [2025-03-17 04:53:43,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3086 states, 2695 states have (on average 1.6059369202226346) internal successors, (4328), 2703 states have internal predecessors, (4328), 371 states have call successors, (371), 19 states have call predecessors, (371), 19 states have return successors, (371), 363 states have call predecessors, (371), 371 states have call successors, (371) [2025-03-17 04:53:43,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 5070 transitions. [2025-03-17 04:53:43,727 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 5070 transitions. Word has length 440 [2025-03-17 04:53:43,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:53:43,728 INFO L471 AbstractCegarLoop]: Abstraction has 3086 states and 5070 transitions. [2025-03-17 04:53:43,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:43,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 5070 transitions. [2025-03-17 04:53:43,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-03-17 04:53:43,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:53:43,736 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:53:43,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 04:53:43,736 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:53:43,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:53:43,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1067679484, now seen corresponding path program 1 times [2025-03-17 04:53:43,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:53:43,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66387340] [2025-03-17 04:53:43,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:43,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:53:43,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-17 04:53:44,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-17 04:53:44,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:44,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:44,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-17 04:53:44,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:53:44,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66387340] [2025-03-17 04:53:44,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66387340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:53:44,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:53:44,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:53:44,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281650608] [2025-03-17 04:53:44,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:53:44,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:53:44,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:53:44,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:53:44,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:53:44,404 INFO L87 Difference]: Start difference. First operand 3086 states and 5070 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:44,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:53:44,886 INFO L93 Difference]: Finished difference Result 11262 states and 18378 transitions. [2025-03-17 04:53:44,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 04:53:44,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 440 [2025-03-17 04:53:44,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:53:44,920 INFO L225 Difference]: With dead ends: 11262 [2025-03-17 04:53:44,920 INFO L226 Difference]: Without dead ends: 8312 [2025-03-17 04:53:44,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:53:44,932 INFO L435 NwaCegarLoop]: 828 mSDtfsCounter, 1003 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:53:44,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 2171 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:53:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8312 states. [2025-03-17 04:53:45,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8312 to 3330. [2025-03-17 04:53:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3330 states, 2939 states have (on average 1.611432460020415) internal successors, (4736), 2947 states have internal predecessors, (4736), 371 states have call successors, (371), 19 states have call predecessors, (371), 19 states have return successors, (371), 363 states have call predecessors, (371), 371 states have call successors, (371) [2025-03-17 04:53:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3330 states to 3330 states and 5478 transitions. [2025-03-17 04:53:45,168 INFO L78 Accepts]: Start accepts. Automaton has 3330 states and 5478 transitions. Word has length 440 [2025-03-17 04:53:45,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:53:45,169 INFO L471 AbstractCegarLoop]: Abstraction has 3330 states and 5478 transitions. [2025-03-17 04:53:45,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:45,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3330 states and 5478 transitions. [2025-03-17 04:53:45,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-03-17 04:53:45,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:53:45,174 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:53:45,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 04:53:45,175 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:53:45,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:53:45,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2024550146, now seen corresponding path program 1 times [2025-03-17 04:53:45,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:53:45,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171800693] [2025-03-17 04:53:45,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:45,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:53:45,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-03-17 04:53:45,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-03-17 04:53:45,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:45,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-17 04:53:45,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:53:45,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171800693] [2025-03-17 04:53:45,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171800693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:53:45,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:53:45,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:53:45,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043573572] [2025-03-17 04:53:45,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:53:45,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:53:45,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:53:45,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:53:45,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:53:45,856 INFO L87 Difference]: Start difference. First operand 3330 states and 5478 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:46,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:53:46,176 INFO L93 Difference]: Finished difference Result 10622 states and 17545 transitions. [2025-03-17 04:53:46,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:53:46,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 440 [2025-03-17 04:53:46,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:53:46,196 INFO L225 Difference]: With dead ends: 10622 [2025-03-17 04:53:46,196 INFO L226 Difference]: Without dead ends: 7428 [2025-03-17 04:53:46,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-03-17 04:53:46,206 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 372 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:53:46,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1098 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:53:46,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7428 states. [2025-03-17 04:53:46,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7428 to 6344. [2025-03-17 04:53:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6344 states, 5953 states have (on average 1.6485805476230473) internal successors, (9814), 5961 states have internal predecessors, (9814), 371 states have call successors, (371), 19 states have call predecessors, (371), 19 states have return successors, (371), 363 states have call predecessors, (371), 371 states have call successors, (371) [2025-03-17 04:53:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6344 states to 6344 states and 10556 transitions. [2025-03-17 04:53:46,464 INFO L78 Accepts]: Start accepts. Automaton has 6344 states and 10556 transitions. Word has length 440 [2025-03-17 04:53:46,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:53:46,465 INFO L471 AbstractCegarLoop]: Abstraction has 6344 states and 10556 transitions. [2025-03-17 04:53:46,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand 6344 states and 10556 transitions. [2025-03-17 04:53:46,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-17 04:53:46,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:53:46,474 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:53:46,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 04:53:46,475 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:53:46,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:53:46,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1893368394, now seen corresponding path program 1 times [2025-03-17 04:53:46,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:53:46,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776294363] [2025-03-17 04:53:46,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:46,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:53:46,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-17 04:53:46,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-17 04:53:46,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:46,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-17 04:53:47,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:53:47,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776294363] [2025-03-17 04:53:47,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776294363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:53:47,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:53:47,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 04:53:47,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899764250] [2025-03-17 04:53:47,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:53:47,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 04:53:47,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:53:47,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 04:53:47,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 04:53:47,207 INFO L87 Difference]: Start difference. First operand 6344 states and 10556 transitions. Second operand has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:47,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:53:47,825 INFO L93 Difference]: Finished difference Result 17926 states and 29916 transitions. [2025-03-17 04:53:47,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:53:47,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 441 [2025-03-17 04:53:47,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:53:47,854 INFO L225 Difference]: With dead ends: 17926 [2025-03-17 04:53:47,855 INFO L226 Difference]: Without dead ends: 11718 [2025-03-17 04:53:47,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:53:47,871 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 472 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 04:53:47,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1533 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 04:53:47,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11718 states. [2025-03-17 04:53:48,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11718 to 11716. [2025-03-17 04:53:48,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11716 states, 11037 states have (on average 1.6535290386880492) internal successors, (18250), 11047 states have internal predecessors, (18250), 643 states have call successors, (643), 35 states have call predecessors, (643), 35 states have return successors, (643), 633 states have call predecessors, (643), 643 states have call successors, (643) [2025-03-17 04:53:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11716 states to 11716 states and 19536 transitions. [2025-03-17 04:53:48,168 INFO L78 Accepts]: Start accepts. Automaton has 11716 states and 19536 transitions. Word has length 441 [2025-03-17 04:53:48,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:53:48,169 INFO L471 AbstractCegarLoop]: Abstraction has 11716 states and 19536 transitions. [2025-03-17 04:53:48,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.8) internal successors, (129), 5 states have internal predecessors, (129), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 11716 states and 19536 transitions. [2025-03-17 04:53:48,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-17 04:53:48,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:53:48,178 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:53:48,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 04:53:48,178 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:53:48,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:53:48,179 INFO L85 PathProgramCache]: Analyzing trace with hash -970986382, now seen corresponding path program 1 times [2025-03-17 04:53:48,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:53:48,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685102431] [2025-03-17 04:53:48,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:48,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:53:48,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-17 04:53:49,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-17 04:53:49,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:49,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:50,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 9 proven. 177 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-17 04:53:50,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:53:50,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685102431] [2025-03-17 04:53:50,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685102431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:53:50,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898838369] [2025-03-17 04:53:50,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:50,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:53:50,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:53:50,021 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:53:50,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 04:53:50,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-17 04:53:50,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-17 04:53:50,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:50,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:50,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 04:53:50,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:53:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 776 proven. 177 refuted. 0 times theorem prover too weak. 6859 trivial. 0 not checked. [2025-03-17 04:53:50,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:53:51,383 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 9 proven. 177 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-17 04:53:51,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898838369] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:53:51,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:53:51,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 04:53:51,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273207828] [2025-03-17 04:53:51,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:53:51,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 04:53:51,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:53:51,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 04:53:51,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:53:51,386 INFO L87 Difference]: Start difference. First operand 11716 states and 19536 transitions. Second operand has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 2 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (123), 2 states have call predecessors, (123), 2 states have call successors, (123) [2025-03-17 04:53:51,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:53:51,942 INFO L93 Difference]: Finished difference Result 23368 states and 38902 transitions. [2025-03-17 04:53:51,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 04:53:51,943 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 2 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (123), 2 states have call predecessors, (123), 2 states have call successors, (123) Word has length 441 [2025-03-17 04:53:51,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:53:51,971 INFO L225 Difference]: With dead ends: 23368 [2025-03-17 04:53:51,972 INFO L226 Difference]: Without dead ends: 11788 [2025-03-17 04:53:52,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 879 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-17 04:53:52,020 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 461 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:53:52,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 875 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 04:53:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11788 states. [2025-03-17 04:53:52,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11788 to 11680. [2025-03-17 04:53:52,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11680 states, 10982 states have (on average 1.6495173920961574) internal successors, (18115), 10992 states have internal predecessors, (18115), 643 states have call successors, (643), 54 states have call predecessors, (643), 54 states have return successors, (643), 633 states have call predecessors, (643), 643 states have call successors, (643) [2025-03-17 04:53:52,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11680 states to 11680 states and 19401 transitions. [2025-03-17 04:53:52,403 INFO L78 Accepts]: Start accepts. Automaton has 11680 states and 19401 transitions. Word has length 441 [2025-03-17 04:53:52,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:53:52,404 INFO L471 AbstractCegarLoop]: Abstraction has 11680 states and 19401 transitions. [2025-03-17 04:53:52,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.714285714285715) internal successors, (138), 7 states have internal predecessors, (138), 2 states have call successors, (122), 2 states have call predecessors, (122), 4 states have return successors, (123), 2 states have call predecessors, (123), 2 states have call successors, (123) [2025-03-17 04:53:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 11680 states and 19401 transitions. [2025-03-17 04:53:52,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-17 04:53:52,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:53:52,416 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:53:52,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 04:53:52,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 04:53:52,618 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:53:52,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:53:52,619 INFO L85 PathProgramCache]: Analyzing trace with hash -860000016, now seen corresponding path program 1 times [2025-03-17 04:53:52,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:53:52,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146488046] [2025-03-17 04:53:52,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:52,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:53:52,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-17 04:53:52,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-17 04:53:52,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:52,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:53,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-17 04:53:53,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:53:53,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146488046] [2025-03-17 04:53:53,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146488046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:53:53,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:53:53,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:53:53,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441376219] [2025-03-17 04:53:53,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:53:53,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:53:53,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:53:53,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:53:53,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:53:53,112 INFO L87 Difference]: Start difference. First operand 11680 states and 19401 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:53,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:53:53,397 INFO L93 Difference]: Finished difference Result 18894 states and 31164 transitions. [2025-03-17 04:53:53,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:53:53,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 441 [2025-03-17 04:53:53,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:53:53,425 INFO L225 Difference]: With dead ends: 18894 [2025-03-17 04:53:53,425 INFO L226 Difference]: Without dead ends: 12694 [2025-03-17 04:53:53,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-03-17 04:53:53,437 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 248 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:53:53,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1052 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:53:53,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12694 states. [2025-03-17 04:53:53,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12694 to 11732. [2025-03-17 04:53:53,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11732 states, 11015 states have (on average 1.6453926463912847) internal successors, (18124), 11025 states have internal predecessors, (18124), 643 states have call successors, (643), 73 states have call predecessors, (643), 73 states have return successors, (643), 633 states have call predecessors, (643), 643 states have call successors, (643) [2025-03-17 04:53:53,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11732 states to 11732 states and 19410 transitions. [2025-03-17 04:53:53,813 INFO L78 Accepts]: Start accepts. Automaton has 11732 states and 19410 transitions. Word has length 441 [2025-03-17 04:53:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:53:53,814 INFO L471 AbstractCegarLoop]: Abstraction has 11732 states and 19410 transitions. [2025-03-17 04:53:53,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:53,814 INFO L276 IsEmpty]: Start isEmpty. Operand 11732 states and 19410 transitions. [2025-03-17 04:53:53,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-17 04:53:53,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:53:53,822 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:53:53,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 04:53:53,822 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:53:53,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:53:53,824 INFO L85 PathProgramCache]: Analyzing trace with hash -522185609, now seen corresponding path program 1 times [2025-03-17 04:53:53,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:53:53,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478985861] [2025-03-17 04:53:53,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:53,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:53:53,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-17 04:53:54,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-17 04:53:54,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:54,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:54,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-17 04:53:54,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:53:54,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478985861] [2025-03-17 04:53:54,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478985861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:53:54,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:53:54,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 04:53:54,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814693352] [2025-03-17 04:53:54,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:53:54,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 04:53:54,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:53:54,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 04:53:54,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 04:53:54,362 INFO L87 Difference]: Start difference. First operand 11732 states and 19410 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:54,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:53:54,817 INFO L93 Difference]: Finished difference Result 30630 states and 50608 transitions. [2025-03-17 04:53:54,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 04:53:54,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 441 [2025-03-17 04:53:54,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:53:54,862 INFO L225 Difference]: With dead ends: 30630 [2025-03-17 04:53:54,862 INFO L226 Difference]: Without dead ends: 19042 [2025-03-17 04:53:54,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-03-17 04:53:54,880 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 501 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 04:53:54,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 859 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 04:53:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19042 states. [2025-03-17 04:53:55,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19042 to 12886. [2025-03-17 04:53:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12886 states, 12217 states have (on average 1.6382090529589917) internal successors, (20014), 12221 states have internal predecessors, (20014), 607 states have call successors, (607), 61 states have call predecessors, (607), 61 states have return successors, (607), 603 states have call predecessors, (607), 607 states have call successors, (607) [2025-03-17 04:53:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12886 states to 12886 states and 21228 transitions. [2025-03-17 04:53:55,239 INFO L78 Accepts]: Start accepts. Automaton has 12886 states and 21228 transitions. Word has length 441 [2025-03-17 04:53:55,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:53:55,240 INFO L471 AbstractCegarLoop]: Abstraction has 12886 states and 21228 transitions. [2025-03-17 04:53:55,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:53:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 12886 states and 21228 transitions. [2025-03-17 04:53:55,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-17 04:53:55,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:53:55,247 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:53:55,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 04:53:55,247 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:53:55,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:53:55,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1892023627, now seen corresponding path program 1 times [2025-03-17 04:53:55,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:53:55,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448668956] [2025-03-17 04:53:55,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:55,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:53:55,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-17 04:53:56,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-17 04:53:56,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:56,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:56,825 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 90 proven. 96 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-17 04:53:56,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:53:56,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448668956] [2025-03-17 04:53:56,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448668956] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:53:56,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241504436] [2025-03-17 04:53:56,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:53:56,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:53:56,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:53:56,829 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:53:56,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 04:53:56,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-17 04:53:57,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-17 04:53:57,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:53:57,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:53:57,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 04:53:57,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:53:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 308 proven. 183 refuted. 0 times theorem prover too weak. 7321 trivial. 0 not checked. [2025-03-17 04:53:57,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:53:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 3 proven. 183 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-17 04:53:58,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241504436] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:53:58,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:53:58,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 9] total 14 [2025-03-17 04:53:58,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069375997] [2025-03-17 04:53:58,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:53:58,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 04:53:58,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:53:58,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 04:53:58,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-17 04:53:58,201 INFO L87 Difference]: Start difference. First operand 12886 states and 21228 transitions. Second operand has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 3 states have call successors, (185), 2 states have call predecessors, (185), 4 states have return successors, (187), 3 states have call predecessors, (187), 3 states have call successors, (187) [2025-03-17 04:53:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:53:59,606 INFO L93 Difference]: Finished difference Result 20022 states and 32622 transitions. [2025-03-17 04:53:59,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 04:53:59,607 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 3 states have call successors, (185), 2 states have call predecessors, (185), 4 states have return successors, (187), 3 states have call predecessors, (187), 3 states have call successors, (187) Word has length 441 [2025-03-17 04:53:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:53:59,626 INFO L225 Difference]: With dead ends: 20022 [2025-03-17 04:53:59,627 INFO L226 Difference]: Without dead ends: 7280 [2025-03-17 04:53:59,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 911 GetRequests, 875 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=345, Invalid=987, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 04:53:59,640 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 1099 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 722 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 722 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 04:53:59,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 1309 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [722 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 04:53:59,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7280 states. [2025-03-17 04:53:59,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7280 to 3670. [2025-03-17 04:53:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3670 states, 2992 states have (on average 1.4629010695187166) internal successors, (4377), 2996 states have internal predecessors, (4377), 607 states have call successors, (607), 70 states have call predecessors, (607), 70 states have return successors, (607), 603 states have call predecessors, (607), 607 states have call successors, (607) [2025-03-17 04:53:59,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3670 states to 3670 states and 5591 transitions. [2025-03-17 04:53:59,962 INFO L78 Accepts]: Start accepts. Automaton has 3670 states and 5591 transitions. Word has length 441 [2025-03-17 04:53:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:53:59,963 INFO L471 AbstractCegarLoop]: Abstraction has 3670 states and 5591 transitions. [2025-03-17 04:53:59,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 18.428571428571427) internal successors, (258), 14 states have internal predecessors, (258), 3 states have call successors, (185), 2 states have call predecessors, (185), 4 states have return successors, (187), 3 states have call predecessors, (187), 3 states have call successors, (187) [2025-03-17 04:53:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3670 states and 5591 transitions. [2025-03-17 04:53:59,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-17 04:53:59,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:53:59,967 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:53:59,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 04:54:00,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:54:00,171 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:54:00,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:54:00,172 INFO L85 PathProgramCache]: Analyzing trace with hash 767103040, now seen corresponding path program 1 times [2025-03-17 04:54:00,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:54:00,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893265275] [2025-03-17 04:54:00,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:54:00,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:54:00,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-17 04:54:00,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-17 04:54:00,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:54:00,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:54:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7812 trivial. 0 not checked. [2025-03-17 04:54:01,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:54:01,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893265275] [2025-03-17 04:54:01,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893265275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 04:54:01,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 04:54:01,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 04:54:01,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280529994] [2025-03-17 04:54:01,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 04:54:01,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 04:54:01,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:54:01,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 04:54:01,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 04:54:01,077 INFO L87 Difference]: Start difference. First operand 3670 states and 5591 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:54:01,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:54:01,486 INFO L93 Difference]: Finished difference Result 8180 states and 12528 transitions. [2025-03-17 04:54:01,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 04:54:01,486 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) Word has length 443 [2025-03-17 04:54:01,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:54:01,500 INFO L225 Difference]: With dead ends: 8180 [2025-03-17 04:54:01,500 INFO L226 Difference]: Without dead ends: 4658 [2025-03-17 04:54:01,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 04:54:01,506 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 652 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 04:54:01,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1195 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 04:54:01,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4658 states. [2025-03-17 04:54:01,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4658 to 3670. [2025-03-17 04:54:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3670 states, 2992 states have (on average 1.4522058823529411) internal successors, (4345), 2996 states have internal predecessors, (4345), 607 states have call successors, (607), 70 states have call predecessors, (607), 70 states have return successors, (607), 603 states have call predecessors, (607), 607 states have call successors, (607) [2025-03-17 04:54:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3670 states to 3670 states and 5559 transitions. [2025-03-17 04:54:01,762 INFO L78 Accepts]: Start accepts. Automaton has 3670 states and 5559 transitions. Word has length 443 [2025-03-17 04:54:01,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:54:01,763 INFO L471 AbstractCegarLoop]: Abstraction has 3670 states and 5559 transitions. [2025-03-17 04:54:01,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 1 states have call successors, (63), 1 states have call predecessors, (63), 1 states have return successors, (63), 1 states have call predecessors, (63), 1 states have call successors, (63) [2025-03-17 04:54:01,764 INFO L276 IsEmpty]: Start isEmpty. Operand 3670 states and 5559 transitions. [2025-03-17 04:54:01,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-03-17 04:54:01,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:54:01,767 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:54:01,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 04:54:01,767 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:54:01,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:54:01,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1508133627, now seen corresponding path program 1 times [2025-03-17 04:54:01,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:54:01,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98043462] [2025-03-17 04:54:01,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:54:01,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:54:01,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-17 04:54:03,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-17 04:54:03,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:54:03,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:54:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 21 proven. 165 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-17 04:54:03,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:54:03,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98043462] [2025-03-17 04:54:03,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98043462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:54:03,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898717240] [2025-03-17 04:54:03,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:54:03,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:54:03,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:54:03,620 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:54:03,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 04:54:03,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-03-17 04:54:03,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-03-17 04:54:03,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:54:03,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:54:03,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 04:54:03,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:54:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 4289 proven. 216 refuted. 0 times theorem prover too weak. 3307 trivial. 0 not checked. [2025-03-17 04:54:05,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:54:06,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 150 proven. 219 refuted. 0 times theorem prover too weak. 7443 trivial. 0 not checked. [2025-03-17 04:54:06,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898717240] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:54:06,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:54:06,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 19 [2025-03-17 04:54:06,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648713514] [2025-03-17 04:54:06,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:54:06,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 04:54:06,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:54:06,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 04:54:06,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-17 04:54:06,857 INFO L87 Difference]: Start difference. First operand 3670 states and 5559 transitions. Second operand has 19 states, 19 states have (on average 18.526315789473685) internal successors, (352), 19 states have internal predecessors, (352), 6 states have call successors, (157), 3 states have call predecessors, (157), 7 states have return successors, (159), 6 states have call predecessors, (159), 6 states have call successors, (159) [2025-03-17 04:54:08,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:54:08,287 INFO L93 Difference]: Finished difference Result 8072 states and 12128 transitions. [2025-03-17 04:54:08,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-17 04:54:08,288 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 18.526315789473685) internal successors, (352), 19 states have internal predecessors, (352), 6 states have call successors, (157), 3 states have call predecessors, (157), 7 states have return successors, (159), 6 states have call predecessors, (159), 6 states have call successors, (159) Word has length 443 [2025-03-17 04:54:08,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:54:08,300 INFO L225 Difference]: With dead ends: 8072 [2025-03-17 04:54:08,300 INFO L226 Difference]: Without dead ends: 3224 [2025-03-17 04:54:08,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 877 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 571 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=608, Invalid=1744, Unknown=0, NotChecked=0, Total=2352 [2025-03-17 04:54:08,306 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 1470 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 616 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 616 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 04:54:08,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1613 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [616 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 04:54:08,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2025-03-17 04:54:08,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 2418. [2025-03-17 04:54:08,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 1883 states have (on average 1.3552841210833775) internal successors, (2552), 1891 states have internal predecessors, (2552), 443 states have call successors, (443), 91 states have call predecessors, (443), 91 states have return successors, (443), 435 states have call predecessors, (443), 443 states have call successors, (443) [2025-03-17 04:54:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3438 transitions. [2025-03-17 04:54:08,529 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3438 transitions. Word has length 443 [2025-03-17 04:54:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:54:08,529 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 3438 transitions. [2025-03-17 04:54:08,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 18.526315789473685) internal successors, (352), 19 states have internal predecessors, (352), 6 states have call successors, (157), 3 states have call predecessors, (157), 7 states have return successors, (159), 6 states have call predecessors, (159), 6 states have call successors, (159) [2025-03-17 04:54:08,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3438 transitions. [2025-03-17 04:54:08,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-17 04:54:08,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:54:08,534 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:54:08,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 04:54:08,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:54:08,735 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:54:08,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:54:08,735 INFO L85 PathProgramCache]: Analyzing trace with hash 795032047, now seen corresponding path program 1 times [2025-03-17 04:54:08,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:54:08,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358049497] [2025-03-17 04:54:08,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:54:08,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:54:08,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-17 04:54:09,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-17 04:54:09,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:54:09,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:54:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 207 proven. 159 refuted. 0 times theorem prover too weak. 7446 trivial. 0 not checked. [2025-03-17 04:54:09,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:54:09,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358049497] [2025-03-17 04:54:09,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358049497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:54:09,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593881247] [2025-03-17 04:54:09,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:54:09,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:54:09,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:54:09,928 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:54:09,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 04:54:10,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-17 04:54:10,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-17 04:54:10,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:54:10,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:54:10,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 1118 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 04:54:10,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:54:11,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 5532 proven. 102 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-17 04:54:11,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:54:11,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 84 proven. 102 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-17 04:54:11,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593881247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:54:11,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:54:11,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2025-03-17 04:54:11,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771530827] [2025-03-17 04:54:11,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:54:11,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 04:54:11,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:54:11,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 04:54:11,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-03-17 04:54:11,411 INFO L87 Difference]: Start difference. First operand 2418 states and 3438 transitions. Second operand has 23 states, 23 states have (on average 14.869565217391305) internal successors, (342), 23 states have internal predecessors, (342), 9 states have call successors, (145), 4 states have call predecessors, (145), 7 states have return successors, (145), 9 states have call predecessors, (145), 9 states have call successors, (145) [2025-03-17 04:54:13,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:54:13,376 INFO L93 Difference]: Finished difference Result 5830 states and 8143 transitions. [2025-03-17 04:54:13,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 04:54:13,377 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 14.869565217391305) internal successors, (342), 23 states have internal predecessors, (342), 9 states have call successors, (145), 4 states have call predecessors, (145), 7 states have return successors, (145), 9 states have call predecessors, (145), 9 states have call successors, (145) Word has length 444 [2025-03-17 04:54:13,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:54:13,386 INFO L225 Difference]: With dead ends: 5830 [2025-03-17 04:54:13,386 INFO L226 Difference]: Without dead ends: 3580 [2025-03-17 04:54:13,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 881 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=533, Invalid=1447, Unknown=0, NotChecked=0, Total=1980 [2025-03-17 04:54:13,391 INFO L435 NwaCegarLoop]: 365 mSDtfsCounter, 800 mSDsluCounter, 2834 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 3199 SdHoareTripleChecker+Invalid, 2826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 04:54:13,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 3199 Invalid, 2826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 04:54:13,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2025-03-17 04:54:13,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 1994. [2025-03-17 04:54:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1994 states, 1583 states have (on average 1.3771320277953254) internal successors, (2180), 1585 states have internal predecessors, (2180), 335 states have call successors, (335), 75 states have call predecessors, (335), 75 states have return successors, (335), 333 states have call predecessors, (335), 335 states have call successors, (335) [2025-03-17 04:54:13,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2850 transitions. [2025-03-17 04:54:13,609 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2850 transitions. Word has length 444 [2025-03-17 04:54:13,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:54:13,609 INFO L471 AbstractCegarLoop]: Abstraction has 1994 states and 2850 transitions. [2025-03-17 04:54:13,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.869565217391305) internal successors, (342), 23 states have internal predecessors, (342), 9 states have call successors, (145), 4 states have call predecessors, (145), 7 states have return successors, (145), 9 states have call predecessors, (145), 9 states have call successors, (145) [2025-03-17 04:54:13,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2850 transitions. [2025-03-17 04:54:13,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-03-17 04:54:13,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:54:13,612 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:54:13,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 04:54:13,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-17 04:54:13,813 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:54:13,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:54:13,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1564202062, now seen corresponding path program 1 times [2025-03-17 04:54:13,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:54:13,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262465107] [2025-03-17 04:54:13,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:54:13,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:54:13,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-17 04:54:15,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-17 04:54:15,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:54:15,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:54:15,518 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 84 proven. 102 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-17 04:54:15,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 04:54:15,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262465107] [2025-03-17 04:54:15,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262465107] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 04:54:15,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599892673] [2025-03-17 04:54:15,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:54:15,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:54:15,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 04:54:15,520 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 04:54:15,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 04:54:15,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-03-17 04:54:15,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-03-17 04:54:15,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 04:54:15,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 04:54:15,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 04:54:15,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 04:54:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 5628 proven. 102 refuted. 0 times theorem prover too weak. 2082 trivial. 0 not checked. [2025-03-17 04:54:16,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 04:54:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 84 proven. 102 refuted. 0 times theorem prover too weak. 7626 trivial. 0 not checked. [2025-03-17 04:54:17,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599892673] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 04:54:17,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 04:54:17,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2025-03-17 04:54:17,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179027955] [2025-03-17 04:54:17,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 04:54:17,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 04:54:17,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 04:54:17,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 04:54:17,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2025-03-17 04:54:17,097 INFO L87 Difference]: Start difference. First operand 1994 states and 2850 transitions. Second operand has 23 states, 23 states have (on average 14.869565217391305) internal successors, (342), 23 states have internal predecessors, (342), 9 states have call successors, (145), 4 states have call predecessors, (145), 7 states have return successors, (145), 9 states have call predecessors, (145), 9 states have call successors, (145) [2025-03-17 04:54:18,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 04:54:18,196 INFO L93 Difference]: Finished difference Result 4872 states and 6863 transitions. [2025-03-17 04:54:18,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 04:54:18,197 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 14.869565217391305) internal successors, (342), 23 states have internal predecessors, (342), 9 states have call successors, (145), 4 states have call predecessors, (145), 7 states have return successors, (145), 9 states have call predecessors, (145), 9 states have call successors, (145) Word has length 444 [2025-03-17 04:54:18,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 04:54:18,204 INFO L225 Difference]: With dead ends: 4872 [2025-03-17 04:54:18,204 INFO L226 Difference]: Without dead ends: 3054 [2025-03-17 04:54:18,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 908 GetRequests, 876 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=292, Invalid=830, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 04:54:18,206 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 2032 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 754 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2060 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 1792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 754 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 04:54:18,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2060 Valid, 1232 Invalid, 1792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [754 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 04:54:18,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2025-03-17 04:54:18,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 1668. [2025-03-17 04:54:18,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1252 states have (on average 1.3282747603833867) internal successors, (1663), 1254 states have internal predecessors, (1663), 335 states have call successors, (335), 80 states have call predecessors, (335), 80 states have return successors, (335), 333 states have call predecessors, (335), 335 states have call successors, (335) [2025-03-17 04:54:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2333 transitions. [2025-03-17 04:54:18,375 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2333 transitions. Word has length 444 [2025-03-17 04:54:18,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 04:54:18,376 INFO L471 AbstractCegarLoop]: Abstraction has 1668 states and 2333 transitions. [2025-03-17 04:54:18,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.869565217391305) internal successors, (342), 23 states have internal predecessors, (342), 9 states have call successors, (145), 4 states have call predecessors, (145), 7 states have return successors, (145), 9 states have call predecessors, (145), 9 states have call successors, (145) [2025-03-17 04:54:18,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2333 transitions. [2025-03-17 04:54:18,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-03-17 04:54:18,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 04:54:18,378 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 04:54:18,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 04:54:18,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 04:54:18,578 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 04:54:18,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 04:54:18,580 INFO L85 PathProgramCache]: Analyzing trace with hash -73255530, now seen corresponding path program 1 times [2025-03-17 04:54:18,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 04:54:18,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412242380] [2025-03-17 04:54:18,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 04:54:18,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 04:54:18,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes.