./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-80.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 331df49ab4a0447b27b0a585123d8827689038cde32f4bb2dec4383418b91892 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:01:28,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:01:28,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:01:28,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:01:28,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:01:28,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:01:28,140 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:01:28,140 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:01:28,140 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:01:28,140 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:01:28,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:01:28,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:01:28,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:01:28,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:01:28,143 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:01:28,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:01:28,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:01:28,144 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:01:28,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:01:28,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:01:28,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:01:28,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:01:28,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:01:28,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:01:28,144 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:01:28,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:01:28,144 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:01:28,144 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:01:28,144 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:01:28,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:01:28,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:01:28,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:01:28,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:01:28,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:01:28,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:01:28,145 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:01:28,145 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:01:28,145 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:01:28,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:01:28,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:01:28,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:01:28,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:01:28,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:01:28,145 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 331df49ab4a0447b27b0a585123d8827689038cde32f4bb2dec4383418b91892 [2025-02-05 22:01:28,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:01:28,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:01:28,384 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:01:28,385 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:01:28,385 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:01:28,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-80.i [2025-02-05 22:01:29,564 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49e6e9c49/995a27212667488195fe0899fd9b5e9d/FLAG320ff460a [2025-02-05 22:01:29,927 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:01:29,930 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-80.i [2025-02-05 22:01:29,941 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49e6e9c49/995a27212667488195fe0899fd9b5e9d/FLAG320ff460a [2025-02-05 22:01:30,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49e6e9c49/995a27212667488195fe0899fd9b5e9d [2025-02-05 22:01:30,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:01:30,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:01:30,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:01:30,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:01:30,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:01:30,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:01:30" (1/1) ... [2025-02-05 22:01:30,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@645a808a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:30, skipping insertion in model container [2025-02-05 22:01:30,164 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:01:30" (1/1) ... [2025-02-05 22:01:30,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:01:30,290 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-80.i[916,929] [2025-02-05 22:01:30,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:01:30,428 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:01:30,434 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-80.i[916,929] [2025-02-05 22:01:30,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:01:30,510 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:01:30,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:30 WrapperNode [2025-02-05 22:01:30,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:01:30,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:01:30,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:01:30,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:01:30,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:30" (1/1) ... [2025-02-05 22:01:30,532 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:30" (1/1) ... [2025-02-05 22:01:30,608 INFO L138 Inliner]: procedures = 26, calls = 97, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 751 [2025-02-05 22:01:30,608 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:01:30,609 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:01:30,609 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:01:30,609 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:01:30,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:30" (1/1) ... [2025-02-05 22:01:30,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:30" (1/1) ... [2025-02-05 22:01:30,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:30" (1/1) ... [2025-02-05 22:01:30,674 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-02-05 22:01:30,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:30" (1/1) ... [2025-02-05 22:01:30,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:30" (1/1) ... [2025-02-05 22:01:30,699 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:30" (1/1) ... [2025-02-05 22:01:30,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:30" (1/1) ... [2025-02-05 22:01:30,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:30" (1/1) ... [2025-02-05 22:01:30,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:30" (1/1) ... [2025-02-05 22:01:30,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:01:30,733 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:01:30,733 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:01:30,733 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:01:30,734 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:30" (1/1) ... [2025-02-05 22:01:30,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:01:30,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:01:30,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:01:30,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:01:30,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:01:30,781 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:01:30,781 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:01:30,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:01:30,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:01:30,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:01:30,919 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:01:30,920 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:01:31,958 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-05 22:01:31,959 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:01:31,988 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:01:31,988 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:01:31,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:01:31 BoogieIcfgContainer [2025-02-05 22:01:31,988 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:01:31,990 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:01:31,990 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:01:31,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:01:31,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:01:30" (1/3) ... [2025-02-05 22:01:31,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25072f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:01:31, skipping insertion in model container [2025-02-05 22:01:31,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:01:30" (2/3) ... [2025-02-05 22:01:31,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25072f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:01:31, skipping insertion in model container [2025-02-05 22:01:31,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:01:31" (3/3) ... [2025-02-05 22:01:31,997 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-80.i [2025-02-05 22:01:32,006 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:01:32,009 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-80.i that has 2 procedures, 304 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:01:32,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:01:32,076 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;@43db98e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:01:32,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:01:32,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 304 states, 217 states have (on average 1.6221198156682028) internal successors, (352), 218 states have internal predecessors, (352), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 22:01:32,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2025-02-05 22:01:32,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:32,119 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:01:32,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:32,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:32,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1268947126, now seen corresponding path program 1 times [2025-02-05 22:01:32,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:32,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653404154] [2025-02-05 22:01:32,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:32,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:32,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 568 statements into 1 equivalence classes. [2025-02-05 22:01:32,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 568 of 568 statements. [2025-02-05 22:01:32,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:32,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:01:32,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:32,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653404154] [2025-02-05 22:01:32,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653404154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:32,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:32,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 22:01:32,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155673926] [2025-02-05 22:01:32,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:32,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:01:32,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:32,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:01:32,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:01:32,788 INFO L87 Difference]: Start difference. First operand has 304 states, 217 states have (on average 1.6221198156682028) internal successors, (352), 218 states have internal predecessors, (352), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) Second operand has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:32,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:32,869 INFO L93 Difference]: Finished difference Result 602 states and 1119 transitions. [2025-02-05 22:01:32,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:01:32,872 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 568 [2025-02-05 22:01:32,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:32,883 INFO L225 Difference]: With dead ends: 602 [2025-02-05 22:01:32,883 INFO L226 Difference]: Without dead ends: 301 [2025-02-05 22:01:32,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:01:32,893 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:32,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 499 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:01:32,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-02-05 22:01:32,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2025-02-05 22:01:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 215 states have (on average 1.5953488372093023) internal successors, (343), 215 states have internal predecessors, (343), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 22:01:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 511 transitions. [2025-02-05 22:01:32,975 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 511 transitions. Word has length 568 [2025-02-05 22:01:32,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:32,978 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 511 transitions. [2025-02-05 22:01:32,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 75.5) internal successors, (151), 2 states have internal predecessors, (151), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 511 transitions. [2025-02-05 22:01:32,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-02-05 22:01:32,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:32,992 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:01:32,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 22:01:32,992 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:32,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:32,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1221295598, now seen corresponding path program 1 times [2025-02-05 22:01:32,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:32,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910025326] [2025-02-05 22:01:32,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:32,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:33,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-02-05 22:01:33,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-02-05 22:01:33,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:33,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:33,504 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:01:33,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:33,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910025326] [2025-02-05 22:01:33,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910025326] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:33,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:33,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:01:33,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487856092] [2025-02-05 22:01:33,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:33,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:01:33,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:33,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:01:33,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:01:33,510 INFO L87 Difference]: Start difference. First operand 301 states and 511 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:33,651 INFO L93 Difference]: Finished difference Result 895 states and 1523 transitions. [2025-02-05 22:01:33,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:01:33,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 569 [2025-02-05 22:01:33,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:33,661 INFO L225 Difference]: With dead ends: 895 [2025-02-05 22:01:33,663 INFO L226 Difference]: Without dead ends: 597 [2025-02-05 22:01:33,665 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-02-05 22:01:33,666 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 490 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:33,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1217 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:01:33,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-02-05 22:01:33,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 418. [2025-02-05 22:01:33,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 332 states have (on average 1.6746987951807228) internal successors, (556), 332 states have internal predecessors, (556), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 22:01:33,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 724 transitions. [2025-02-05 22:01:33,728 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 724 transitions. Word has length 569 [2025-02-05 22:01:33,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:33,729 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 724 transitions. [2025-02-05 22:01:33,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:33,731 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 724 transitions. [2025-02-05 22:01:33,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-02-05 22:01:33,740 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:33,740 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:01:33,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:01:33,740 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:33,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:33,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1722033934, now seen corresponding path program 1 times [2025-02-05 22:01:33,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:33,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975554436] [2025-02-05 22:01:33,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:33,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:33,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-02-05 22:01:33,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-02-05 22:01:33,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:33,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:01:34,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:34,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975554436] [2025-02-05 22:01:34,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975554436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:34,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:34,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:01:34,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549101875] [2025-02-05 22:01:34,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:34,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:01:34,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:34,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:01:34,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:01:34,004 INFO L87 Difference]: Start difference. First operand 418 states and 724 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:34,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:34,100 INFO L93 Difference]: Finished difference Result 1165 states and 2029 transitions. [2025-02-05 22:01:34,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:01:34,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 569 [2025-02-05 22:01:34,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:34,105 INFO L225 Difference]: With dead ends: 1165 [2025-02-05 22:01:34,105 INFO L226 Difference]: Without dead ends: 750 [2025-02-05 22:01:34,106 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-02-05 22:01:34,108 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 355 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:34,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1101 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:01:34,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2025-02-05 22:01:34,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 747. [2025-02-05 22:01:34,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 623 states have (on average 1.6918138041733548) internal successors, (1054), 624 states have internal predecessors, (1054), 121 states have call successors, (121), 2 states have call predecessors, (121), 2 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2025-02-05 22:01:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1296 transitions. [2025-02-05 22:01:34,170 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1296 transitions. Word has length 569 [2025-02-05 22:01:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:34,171 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1296 transitions. [2025-02-05 22:01:34,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:34,173 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1296 transitions. [2025-02-05 22:01:34,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-02-05 22:01:34,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:34,183 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:01:34,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:01:34,183 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:34,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash 967857806, now seen corresponding path program 1 times [2025-02-05 22:01:34,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:34,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106743443] [2025-02-05 22:01:34,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:34,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:34,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-02-05 22:01:34,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-02-05 22:01:34,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:34,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:34,416 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:01:34,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:34,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106743443] [2025-02-05 22:01:34,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106743443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:34,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:34,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:01:34,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327923022] [2025-02-05 22:01:34,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:34,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:01:34,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:34,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:01:34,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:01:34,419 INFO L87 Difference]: Start difference. First operand 747 states and 1296 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:34,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:34,501 INFO L93 Difference]: Finished difference Result 2107 states and 3666 transitions. [2025-02-05 22:01:34,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:01:34,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 569 [2025-02-05 22:01:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:34,509 INFO L225 Difference]: With dead ends: 2107 [2025-02-05 22:01:34,509 INFO L226 Difference]: Without dead ends: 1363 [2025-02-05 22:01:34,511 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-02-05 22:01:34,512 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 321 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:34,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 974 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:01:34,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2025-02-05 22:01:34,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1359. [2025-02-05 22:01:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1175 states have (on average 1.702127659574468) internal successors, (2000), 1178 states have internal predecessors, (2000), 179 states have call successors, (179), 4 states have call predecessors, (179), 4 states have return successors, (179), 176 states have call predecessors, (179), 179 states have call successors, (179) [2025-02-05 22:01:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 2358 transitions. [2025-02-05 22:01:34,585 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 2358 transitions. Word has length 569 [2025-02-05 22:01:34,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:34,587 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 2358 transitions. [2025-02-05 22:01:34,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:34,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 2358 transitions. [2025-02-05 22:01:34,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-02-05 22:01:34,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:34,595 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:01:34,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:01:34,595 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:34,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:34,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1497991031, now seen corresponding path program 1 times [2025-02-05 22:01:34,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:34,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162740081] [2025-02-05 22:01:34,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:34,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:34,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-02-05 22:01:34,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-02-05 22:01:34,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:34,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:01:34,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:34,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162740081] [2025-02-05 22:01:34,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162740081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:34,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:34,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:01:34,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349155109] [2025-02-05 22:01:34,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:34,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:01:34,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:34,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:01:34,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:01:34,789 INFO L87 Difference]: Start difference. First operand 1359 states and 2358 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:34,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:34,915 INFO L93 Difference]: Finished difference Result 3796 states and 6583 transitions. [2025-02-05 22:01:34,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:01:34,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 569 [2025-02-05 22:01:34,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:34,926 INFO L225 Difference]: With dead ends: 3796 [2025-02-05 22:01:34,926 INFO L226 Difference]: Without dead ends: 2440 [2025-02-05 22:01:34,929 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-02-05 22:01:34,929 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 356 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:34,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1228 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:01:34,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2440 states. [2025-02-05 22:01:35,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2440 to 2437. [2025-02-05 22:01:35,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2437 states, 2101 states have (on average 1.6811042360780581) internal successors, (3532), 2108 states have internal predecessors, (3532), 327 states have call successors, (327), 8 states have call predecessors, (327), 8 states have return successors, (327), 320 states have call predecessors, (327), 327 states have call successors, (327) [2025-02-05 22:01:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2437 states to 2437 states and 4186 transitions. [2025-02-05 22:01:35,020 INFO L78 Accepts]: Start accepts. Automaton has 2437 states and 4186 transitions. Word has length 569 [2025-02-05 22:01:35,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:35,021 INFO L471 AbstractCegarLoop]: Abstraction has 2437 states and 4186 transitions. [2025-02-05 22:01:35,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2437 states and 4186 transitions. [2025-02-05 22:01:35,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-02-05 22:01:35,028 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:35,029 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:01:35,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 22:01:35,029 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:35,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:35,030 INFO L85 PathProgramCache]: Analyzing trace with hash 283508904, now seen corresponding path program 1 times [2025-02-05 22:01:35,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:35,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436930583] [2025-02-05 22:01:35,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:35,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:35,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-02-05 22:01:35,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-02-05 22:01:35,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:35,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:35,220 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:01:35,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:35,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436930583] [2025-02-05 22:01:35,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436930583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:35,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:35,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:01:35,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555222604] [2025-02-05 22:01:35,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:35,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:01:35,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:35,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:01:35,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:01:35,224 INFO L87 Difference]: Start difference. First operand 2437 states and 4186 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:35,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:35,410 INFO L93 Difference]: Finished difference Result 7049 states and 12084 transitions. [2025-02-05 22:01:35,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:01:35,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 569 [2025-02-05 22:01:35,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:35,431 INFO L225 Difference]: With dead ends: 7049 [2025-02-05 22:01:35,431 INFO L226 Difference]: Without dead ends: 4615 [2025-02-05 22:01:35,438 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-02-05 22:01:35,439 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 319 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:35,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1044 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:01:35,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4615 states. [2025-02-05 22:01:35,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4615 to 4611. [2025-02-05 22:01:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4611 states, 3975 states have (on average 1.671446540880503) internal successors, (6644), 3990 states have internal predecessors, (6644), 619 states have call successors, (619), 16 states have call predecessors, (619), 16 states have return successors, (619), 604 states have call predecessors, (619), 619 states have call successors, (619) [2025-02-05 22:01:35,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4611 states to 4611 states and 7882 transitions. [2025-02-05 22:01:35,620 INFO L78 Accepts]: Start accepts. Automaton has 4611 states and 7882 transitions. Word has length 569 [2025-02-05 22:01:35,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:35,621 INFO L471 AbstractCegarLoop]: Abstraction has 4611 states and 7882 transitions. [2025-02-05 22:01:35,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:35,621 INFO L276 IsEmpty]: Start isEmpty. Operand 4611 states and 7882 transitions. [2025-02-05 22:01:35,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-02-05 22:01:35,631 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:35,631 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:01:35,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:01:35,631 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:35,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:35,632 INFO L85 PathProgramCache]: Analyzing trace with hash 727120327, now seen corresponding path program 1 times [2025-02-05 22:01:35,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:35,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362066711] [2025-02-05 22:01:35,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:35,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:35,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-02-05 22:01:35,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-02-05 22:01:35,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:35,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:01:35,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:35,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362066711] [2025-02-05 22:01:35,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362066711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:35,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:35,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:01:35,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918301182] [2025-02-05 22:01:35,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:35,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:01:35,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:35,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:01:35,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:01:35,843 INFO L87 Difference]: Start difference. First operand 4611 states and 7882 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:36,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:36,046 INFO L93 Difference]: Finished difference Result 11217 states and 19023 transitions. [2025-02-05 22:01:36,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:01:36,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 569 [2025-02-05 22:01:36,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:36,082 INFO L225 Difference]: With dead ends: 11217 [2025-02-05 22:01:36,082 INFO L226 Difference]: Without dead ends: 6609 [2025-02-05 22:01:36,094 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-02-05 22:01:36,095 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 223 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:36,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 983 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:01:36,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6609 states. [2025-02-05 22:01:36,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6609 to 6606. [2025-02-05 22:01:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6606 states, 5361 states have (on average 1.6112665547472487) internal successors, (8638), 5392 states have internal predecessors, (8638), 1212 states have call successors, (1212), 32 states have call predecessors, (1212), 32 states have return successors, (1212), 1181 states have call predecessors, (1212), 1212 states have call successors, (1212) [2025-02-05 22:01:36,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6606 states to 6606 states and 11062 transitions. [2025-02-05 22:01:36,395 INFO L78 Accepts]: Start accepts. Automaton has 6606 states and 11062 transitions. Word has length 569 [2025-02-05 22:01:36,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:36,396 INFO L471 AbstractCegarLoop]: Abstraction has 6606 states and 11062 transitions. [2025-02-05 22:01:36,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:36,396 INFO L276 IsEmpty]: Start isEmpty. Operand 6606 states and 11062 transitions. [2025-02-05 22:01:36,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-02-05 22:01:36,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:36,406 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:01:36,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:01:36,406 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:36,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:36,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1688734344, now seen corresponding path program 1 times [2025-02-05 22:01:36,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:36,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958004076] [2025-02-05 22:01:36,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:36,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:36,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-02-05 22:01:36,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-02-05 22:01:36,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:36,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:01:36,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:36,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958004076] [2025-02-05 22:01:36,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958004076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:36,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:36,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:01:36,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394210395] [2025-02-05 22:01:36,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:36,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:01:36,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:36,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:01:36,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:01:36,609 INFO L87 Difference]: Start difference. First operand 6606 states and 11062 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:36,831 INFO L93 Difference]: Finished difference Result 13221 states and 22130 transitions. [2025-02-05 22:01:36,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:01:36,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 569 [2025-02-05 22:01:36,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:36,868 INFO L225 Difference]: With dead ends: 13221 [2025-02-05 22:01:36,868 INFO L226 Difference]: Without dead ends: 6618 [2025-02-05 22:01:36,885 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-02-05 22:01:36,886 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 301 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:36,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 1015 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:01:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6618 states. [2025-02-05 22:01:37,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6618 to 5060. [2025-02-05 22:01:37,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5060 states, 4417 states have (on average 1.64953588408422) internal successors, (7286), 4432 states have internal predecessors, (7286), 624 states have call successors, (624), 18 states have call predecessors, (624), 18 states have return successors, (624), 609 states have call predecessors, (624), 624 states have call successors, (624) [2025-02-05 22:01:37,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5060 states to 5060 states and 8534 transitions. [2025-02-05 22:01:37,174 INFO L78 Accepts]: Start accepts. Automaton has 5060 states and 8534 transitions. Word has length 569 [2025-02-05 22:01:37,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:37,175 INFO L471 AbstractCegarLoop]: Abstraction has 5060 states and 8534 transitions. [2025-02-05 22:01:37,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:37,176 INFO L276 IsEmpty]: Start isEmpty. Operand 5060 states and 8534 transitions. [2025-02-05 22:01:37,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-02-05 22:01:37,187 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:37,188 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:01:37,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:01:37,188 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:37,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:37,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1801429255, now seen corresponding path program 1 times [2025-02-05 22:01:37,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:37,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381358881] [2025-02-05 22:01:37,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:37,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:37,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-02-05 22:01:37,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-02-05 22:01:37,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:37,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:01:37,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:37,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381358881] [2025-02-05 22:01:37,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381358881] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:37,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:37,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:01:37,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797432217] [2025-02-05 22:01:37,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:37,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:01:37,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:37,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:01:37,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:01:37,599 INFO L87 Difference]: Start difference. First operand 5060 states and 8534 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:37,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:37,888 INFO L93 Difference]: Finished difference Result 15174 states and 25596 transitions. [2025-02-05 22:01:37,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:01:37,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 569 [2025-02-05 22:01:37,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:37,920 INFO L225 Difference]: With dead ends: 15174 [2025-02-05 22:01:37,920 INFO L226 Difference]: Without dead ends: 10117 [2025-02-05 22:01:37,932 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-02-05 22:01:37,932 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 507 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:37,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1476 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:01:37,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10117 states. [2025-02-05 22:01:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10117 to 5092. [2025-02-05 22:01:38,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5092 states, 4449 states have (on average 1.644864014385255) internal successors, (7318), 4464 states have internal predecessors, (7318), 624 states have call successors, (624), 18 states have call predecessors, (624), 18 states have return successors, (624), 609 states have call predecessors, (624), 624 states have call successors, (624) [2025-02-05 22:01:38,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5092 states to 5092 states and 8566 transitions. [2025-02-05 22:01:38,139 INFO L78 Accepts]: Start accepts. Automaton has 5092 states and 8566 transitions. Word has length 569 [2025-02-05 22:01:38,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:38,140 INFO L471 AbstractCegarLoop]: Abstraction has 5092 states and 8566 transitions. [2025-02-05 22:01:38,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 5092 states and 8566 transitions. [2025-02-05 22:01:38,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-02-05 22:01:38,148 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:38,148 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:01:38,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 22:01:38,149 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:38,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:38,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1604915750, now seen corresponding path program 1 times [2025-02-05 22:01:38,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:38,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218336667] [2025-02-05 22:01:38,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:38,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:38,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-02-05 22:01:38,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-02-05 22:01:38,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:38,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:01:38,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:38,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218336667] [2025-02-05 22:01:38,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218336667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:38,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:38,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:01:38,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850971431] [2025-02-05 22:01:38,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:38,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:01:38,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:38,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:01:38,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:01:38,604 INFO L87 Difference]: Start difference. First operand 5092 states and 8566 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:38,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:38,886 INFO L93 Difference]: Finished difference Result 15270 states and 25692 transitions. [2025-02-05 22:01:38,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:01:38,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 569 [2025-02-05 22:01:38,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:38,916 INFO L225 Difference]: With dead ends: 15270 [2025-02-05 22:01:38,916 INFO L226 Difference]: Without dead ends: 10181 [2025-02-05 22:01:38,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-05 22:01:38,931 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 282 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:38,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 993 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:01:38,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10181 states. [2025-02-05 22:01:39,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10181 to 10179. [2025-02-05 22:01:39,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10179 states, 8894 states have (on average 1.6379581740499214) internal successors, (14568), 8924 states have internal predecessors, (14568), 1248 states have call successors, (1248), 36 states have call predecessors, (1248), 36 states have return successors, (1248), 1218 states have call predecessors, (1248), 1248 states have call successors, (1248) [2025-02-05 22:01:39,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10179 states to 10179 states and 17064 transitions. [2025-02-05 22:01:39,304 INFO L78 Accepts]: Start accepts. Automaton has 10179 states and 17064 transitions. Word has length 569 [2025-02-05 22:01:39,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:39,305 INFO L471 AbstractCegarLoop]: Abstraction has 10179 states and 17064 transitions. [2025-02-05 22:01:39,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:39,305 INFO L276 IsEmpty]: Start isEmpty. Operand 10179 states and 17064 transitions. [2025-02-05 22:01:39,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-02-05 22:01:39,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:39,313 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:01:39,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 22:01:39,314 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:39,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:39,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1930511974, now seen corresponding path program 1 times [2025-02-05 22:01:39,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:39,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12923567] [2025-02-05 22:01:39,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:39,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:39,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-02-05 22:01:39,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-02-05 22:01:39,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:39,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:39,551 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:01:39,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:39,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12923567] [2025-02-05 22:01:39,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12923567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:39,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:39,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:01:39,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794884576] [2025-02-05 22:01:39,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:39,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:01:39,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:39,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:01:39,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:01:39,553 INFO L87 Difference]: Start difference. First operand 10179 states and 17064 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:39,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:39,782 INFO L93 Difference]: Finished difference Result 15236 states and 25515 transitions. [2025-02-05 22:01:39,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:01:39,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 569 [2025-02-05 22:01:39,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:39,801 INFO L225 Difference]: With dead ends: 15236 [2025-02-05 22:01:39,802 INFO L226 Difference]: Without dead ends: 5060 [2025-02-05 22:01:39,822 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-02-05 22:01:39,823 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 0 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:39,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 979 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:01:39,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5060 states. [2025-02-05 22:01:40,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5060 to 5060. [2025-02-05 22:01:40,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5060 states, 4417 states have (on average 1.6278016753452569) internal successors, (7190), 4432 states have internal predecessors, (7190), 624 states have call successors, (624), 18 states have call predecessors, (624), 18 states have return successors, (624), 609 states have call predecessors, (624), 624 states have call successors, (624) [2025-02-05 22:01:40,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5060 states to 5060 states and 8438 transitions. [2025-02-05 22:01:40,045 INFO L78 Accepts]: Start accepts. Automaton has 5060 states and 8438 transitions. Word has length 569 [2025-02-05 22:01:40,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:40,046 INFO L471 AbstractCegarLoop]: Abstraction has 5060 states and 8438 transitions. [2025-02-05 22:01:40,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:40,047 INFO L276 IsEmpty]: Start isEmpty. Operand 5060 states and 8438 transitions. [2025-02-05 22:01:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-02-05 22:01:40,054 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:40,055 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:01:40,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 22:01:40,055 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:40,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:40,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2072308379, now seen corresponding path program 1 times [2025-02-05 22:01:40,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:40,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690740400] [2025-02-05 22:01:40,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:40,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:40,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-02-05 22:01:40,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-02-05 22:01:40,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:40,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:40,727 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:01:40,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:40,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690740400] [2025-02-05 22:01:40,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690740400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:40,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:40,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:01:40,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275028537] [2025-02-05 22:01:40,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:40,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:01:40,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:40,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:01:40,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:01:40,730 INFO L87 Difference]: Start difference. First operand 5060 states and 8438 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:41,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:41,174 INFO L93 Difference]: Finished difference Result 11622 states and 19116 transitions. [2025-02-05 22:01:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:01:41,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 571 [2025-02-05 22:01:41,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:41,197 INFO L225 Difference]: With dead ends: 11622 [2025-02-05 22:01:41,197 INFO L226 Difference]: Without dead ends: 6445 [2025-02-05 22:01:41,209 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-02-05 22:01:41,210 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 864 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:41,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 980 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:01:41,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6445 states. [2025-02-05 22:01:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6445 to 6364. [2025-02-05 22:01:41,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6364 states, 5113 states have (on average 1.5386270291414044) internal successors, (7867), 5144 states have internal predecessors, (7867), 1212 states have call successors, (1212), 38 states have call predecessors, (1212), 38 states have return successors, (1212), 1181 states have call predecessors, (1212), 1212 states have call successors, (1212) [2025-02-05 22:01:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6364 states to 6364 states and 10291 transitions. [2025-02-05 22:01:41,506 INFO L78 Accepts]: Start accepts. Automaton has 6364 states and 10291 transitions. Word has length 571 [2025-02-05 22:01:41,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:41,507 INFO L471 AbstractCegarLoop]: Abstraction has 6364 states and 10291 transitions. [2025-02-05 22:01:41,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 6364 states and 10291 transitions. [2025-02-05 22:01:41,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-02-05 22:01:41,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:41,516 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:01:41,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 22:01:41,516 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:41,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:41,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1440789381, now seen corresponding path program 1 times [2025-02-05 22:01:41,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:41,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813922310] [2025-02-05 22:01:41,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:41,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:41,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-02-05 22:01:41,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-02-05 22:01:41,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:41,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:01:42,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:42,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813922310] [2025-02-05 22:01:42,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813922310] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:42,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:42,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:01:42,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353695184] [2025-02-05 22:01:42,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:42,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:01:42,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:42,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:01:42,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:01:42,005 INFO L87 Difference]: Start difference. First operand 6364 states and 10291 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:42,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:42,669 INFO L93 Difference]: Finished difference Result 14636 states and 23662 transitions. [2025-02-05 22:01:42,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:01:42,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 571 [2025-02-05 22:01:42,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:42,702 INFO L225 Difference]: With dead ends: 14636 [2025-02-05 22:01:42,702 INFO L226 Difference]: Without dead ends: 8275 [2025-02-05 22:01:42,720 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-02-05 22:01:42,721 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 308 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:42,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1484 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:01:42,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8275 states. [2025-02-05 22:01:43,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8275 to 8273. [2025-02-05 22:01:43,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8273 states, 6610 states have (on average 1.5311649016641453) internal successors, (10121), 6649 states have internal predecessors, (10121), 1609 states have call successors, (1609), 53 states have call predecessors, (1609), 53 states have return successors, (1609), 1570 states have call predecessors, (1609), 1609 states have call successors, (1609) [2025-02-05 22:01:43,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8273 states to 8273 states and 13339 transitions. [2025-02-05 22:01:43,303 INFO L78 Accepts]: Start accepts. Automaton has 8273 states and 13339 transitions. Word has length 571 [2025-02-05 22:01:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:43,304 INFO L471 AbstractCegarLoop]: Abstraction has 8273 states and 13339 transitions. [2025-02-05 22:01:43,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 8273 states and 13339 transitions. [2025-02-05 22:01:43,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-02-05 22:01:43,316 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:43,316 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:01:43,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 22:01:43,317 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:43,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:43,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1137954340, now seen corresponding path program 1 times [2025-02-05 22:01:43,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:43,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33488722] [2025-02-05 22:01:43,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:43,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:43,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-02-05 22:01:43,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-02-05 22:01:43,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:43,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:01:44,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:44,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33488722] [2025-02-05 22:01:44,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33488722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:44,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:44,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:01:44,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102434306] [2025-02-05 22:01:44,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:44,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:01:44,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:44,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:01:44,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:01:44,019 INFO L87 Difference]: Start difference. First operand 8273 states and 13339 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:44,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:44,671 INFO L93 Difference]: Finished difference Result 17089 states and 27585 transitions. [2025-02-05 22:01:44,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:01:44,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 571 [2025-02-05 22:01:44,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:44,705 INFO L225 Difference]: With dead ends: 17089 [2025-02-05 22:01:44,706 INFO L226 Difference]: Without dead ends: 8885 [2025-02-05 22:01:44,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:01:44,722 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 674 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1588 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:44,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1588 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:01:44,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8885 states. [2025-02-05 22:01:44,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8885 to 6646. [2025-02-05 22:01:45,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6646 states, 5749 states have (on average 1.5898417116020178) internal successors, (9140), 5768 states have internal predecessors, (9140), 865 states have call successors, (865), 31 states have call predecessors, (865), 31 states have return successors, (865), 846 states have call predecessors, (865), 865 states have call successors, (865) [2025-02-05 22:01:45,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6646 states to 6646 states and 10870 transitions. [2025-02-05 22:01:45,029 INFO L78 Accepts]: Start accepts. Automaton has 6646 states and 10870 transitions. Word has length 571 [2025-02-05 22:01:45,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:45,030 INFO L471 AbstractCegarLoop]: Abstraction has 6646 states and 10870 transitions. [2025-02-05 22:01:45,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:45,031 INFO L276 IsEmpty]: Start isEmpty. Operand 6646 states and 10870 transitions. [2025-02-05 22:01:45,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-02-05 22:01:45,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:45,040 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:01:45,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 22:01:45,040 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:45,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:45,040 INFO L85 PathProgramCache]: Analyzing trace with hash 883217795, now seen corresponding path program 1 times [2025-02-05 22:01:45,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:45,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132051085] [2025-02-05 22:01:45,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:45,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:45,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-02-05 22:01:45,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-02-05 22:01:45,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:45,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:01:45,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:45,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132051085] [2025-02-05 22:01:45,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132051085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:45,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:45,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:01:45,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504099425] [2025-02-05 22:01:45,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:45,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:01:45,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:45,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:01:45,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:01:45,477 INFO L87 Difference]: Start difference. First operand 6646 states and 10870 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:46,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:46,155 INFO L93 Difference]: Finished difference Result 19546 states and 32058 transitions. [2025-02-05 22:01:46,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:01:46,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 571 [2025-02-05 22:01:46,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:46,197 INFO L225 Difference]: With dead ends: 19546 [2025-02-05 22:01:46,197 INFO L226 Difference]: Without dead ends: 13001 [2025-02-05 22:01:46,210 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-02-05 22:01:46,211 INFO L435 NwaCegarLoop]: 1243 mSDtfsCounter, 955 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 2964 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:46,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 2964 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:01:46,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13001 states. [2025-02-05 22:01:46,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13001 to 5564. [2025-02-05 22:01:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5564 states, 5054 states have (on average 1.6325682627621685) internal successors, (8251), 5063 states have internal predecessors, (8251), 489 states have call successors, (489), 20 states have call predecessors, (489), 20 states have return successors, (489), 480 states have call predecessors, (489), 489 states have call successors, (489) [2025-02-05 22:01:46,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5564 states to 5564 states and 9229 transitions. [2025-02-05 22:01:46,511 INFO L78 Accepts]: Start accepts. Automaton has 5564 states and 9229 transitions. Word has length 571 [2025-02-05 22:01:46,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:46,512 INFO L471 AbstractCegarLoop]: Abstraction has 5564 states and 9229 transitions. [2025-02-05 22:01:46,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:46,512 INFO L276 IsEmpty]: Start isEmpty. Operand 5564 states and 9229 transitions. [2025-02-05 22:01:46,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-02-05 22:01:46,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:46,519 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:01:46,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 22:01:46,519 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:46,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:46,520 INFO L85 PathProgramCache]: Analyzing trace with hash -113854558, now seen corresponding path program 1 times [2025-02-05 22:01:46,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:46,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682572289] [2025-02-05 22:01:46,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:46,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:46,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-02-05 22:01:46,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-02-05 22:01:46,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:46,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:48,460 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:01:48,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:48,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682572289] [2025-02-05 22:01:48,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682572289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:01:48,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:01:48,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 22:01:48,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193530047] [2025-02-05 22:01:48,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:01:48,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 22:01:48,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:01:48,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 22:01:48,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2025-02-05 22:01:48,464 INFO L87 Difference]: Start difference. First operand 5564 states and 9229 transitions. Second operand has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 15 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:57,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:01:57,789 INFO L93 Difference]: Finished difference Result 37811 states and 61899 transitions. [2025-02-05 22:01:57,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 22:01:57,790 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 15 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 571 [2025-02-05 22:01:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:01:57,865 INFO L225 Difference]: With dead ends: 37811 [2025-02-05 22:01:57,865 INFO L226 Difference]: Without dead ends: 32341 [2025-02-05 22:01:57,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=283, Invalid=907, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 22:01:57,881 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 9188 mSDsluCounter, 6245 mSDsCounter, 0 mSdLazyCounter, 5488 mSolverCounterSat, 4188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9188 SdHoareTripleChecker+Valid, 7124 SdHoareTripleChecker+Invalid, 9676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4188 IncrementalHoareTripleChecker+Valid, 5488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:01:57,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9188 Valid, 7124 Invalid, 9676 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4188 Valid, 5488 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2025-02-05 22:01:57,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32341 states. [2025-02-05 22:01:59,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32341 to 27868. [2025-02-05 22:01:59,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27868 states, 25246 states have (on average 1.60766061950408) internal successors, (40587), 25294 states have internal predecessors, (40587), 2506 states have call successors, (2506), 115 states have call predecessors, (2506), 115 states have return successors, (2506), 2458 states have call predecessors, (2506), 2506 states have call successors, (2506) [2025-02-05 22:01:59,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27868 states to 27868 states and 45599 transitions. [2025-02-05 22:01:59,218 INFO L78 Accepts]: Start accepts. Automaton has 27868 states and 45599 transitions. Word has length 571 [2025-02-05 22:01:59,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:01:59,219 INFO L471 AbstractCegarLoop]: Abstraction has 27868 states and 45599 transitions. [2025-02-05 22:01:59,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.266666666666667) internal successors, (154), 15 states have internal predecessors, (154), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:01:59,220 INFO L276 IsEmpty]: Start isEmpty. Operand 27868 states and 45599 transitions. [2025-02-05 22:01:59,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2025-02-05 22:01:59,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:01:59,248 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:01:59,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 22:01:59,248 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:01:59,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:01:59,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2123958399, now seen corresponding path program 1 times [2025-02-05 22:01:59,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:01:59,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339893885] [2025-02-05 22:01:59,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:59,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:01:59,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-02-05 22:01:59,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-02-05 22:01:59,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:01:59,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:01:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 117 proven. 132 refuted. 0 times theorem prover too weak. 13695 trivial. 0 not checked. [2025-02-05 22:01:59,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:01:59,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339893885] [2025-02-05 22:01:59,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339893885] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:01:59,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795905448] [2025-02-05 22:01:59,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:01:59,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:01:59,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:01:59,826 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:01:59,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 22:02:00,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 571 statements into 1 equivalence classes. [2025-02-05 22:02:00,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 571 of 571 statements. [2025-02-05 22:02:00,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:00,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:00,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 22:02:00,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:02:00,371 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 3149 proven. 30 refuted. 0 times theorem prover too weak. 10765 trivial. 0 not checked. [2025-02-05 22:02:00,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:02:00,723 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 219 proven. 30 refuted. 0 times theorem prover too weak. 13695 trivial. 0 not checked. [2025-02-05 22:02:00,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795905448] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:02:00,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:02:00,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-05 22:02:00,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812760257] [2025-02-05 22:02:00,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:02:00,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:02:00,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:00,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:02:00,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:02:00,728 INFO L87 Difference]: Start difference. First operand 27868 states and 45599 transitions. Second operand has 9 states, 9 states have (on average 33.22222222222222) internal successors, (299), 9 states have internal predecessors, (299), 4 states have call successors, (138), 2 states have call predecessors, (138), 4 states have return successors, (140), 4 states have call predecessors, (140), 4 states have call successors, (140) [2025-02-05 22:02:01,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:01,894 INFO L93 Difference]: Finished difference Result 41794 states and 68383 transitions. [2025-02-05 22:02:01,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 22:02:01,895 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.22222222222222) internal successors, (299), 9 states have internal predecessors, (299), 4 states have call successors, (138), 2 states have call predecessors, (138), 4 states have return successors, (140), 4 states have call predecessors, (140), 4 states have call successors, (140) Word has length 571 [2025-02-05 22:02:01,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:01,935 INFO L225 Difference]: With dead ends: 41794 [2025-02-05 22:02:01,935 INFO L226 Difference]: Without dead ends: 14068 [2025-02-05 22:02:01,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1154 GetRequests, 1139 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:02:01,959 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 548 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:01,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 946 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 22:02:01,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14068 states. [2025-02-05 22:02:02,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14068 to 13178. [2025-02-05 22:02:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13178 states, 11956 states have (on average 1.588992974238876) internal successors, (18998), 11976 states have internal predecessors, (18998), 1154 states have call successors, (1154), 67 states have call predecessors, (1154), 67 states have return successors, (1154), 1134 states have call predecessors, (1154), 1154 states have call successors, (1154) [2025-02-05 22:02:02,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13178 states to 13178 states and 21306 transitions. [2025-02-05 22:02:02,541 INFO L78 Accepts]: Start accepts. Automaton has 13178 states and 21306 transitions. Word has length 571 [2025-02-05 22:02:02,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:02,541 INFO L471 AbstractCegarLoop]: Abstraction has 13178 states and 21306 transitions. [2025-02-05 22:02:02,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.22222222222222) internal successors, (299), 9 states have internal predecessors, (299), 4 states have call successors, (138), 2 states have call predecessors, (138), 4 states have return successors, (140), 4 states have call predecessors, (140), 4 states have call successors, (140) [2025-02-05 22:02:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 13178 states and 21306 transitions. [2025-02-05 22:02:02,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2025-02-05 22:02:02,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:02,550 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:02,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 22:02:02,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 22:02:02,755 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:02,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:02,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1563953898, now seen corresponding path program 1 times [2025-02-05 22:02:02,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:02,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634094386] [2025-02-05 22:02:02,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:02,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:02,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 574 statements into 1 equivalence classes. [2025-02-05 22:02:02,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 574 of 574 statements. [2025-02-05 22:02:02,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:02,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:02:03,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:03,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634094386] [2025-02-05 22:02:03,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634094386] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:03,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:03,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 22:02:03,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657202582] [2025-02-05 22:02:03,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:03,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 22:02:03,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:03,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 22:02:03,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:02:03,208 INFO L87 Difference]: Start difference. First operand 13178 states and 21306 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:02:04,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:04,186 INFO L93 Difference]: Finished difference Result 21326 states and 34630 transitions. [2025-02-05 22:02:04,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 22:02:04,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 574 [2025-02-05 22:02:04,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:04,267 INFO L225 Difference]: With dead ends: 21326 [2025-02-05 22:02:04,268 INFO L226 Difference]: Without dead ends: 13747 [2025-02-05 22:02:04,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-05 22:02:04,275 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 799 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:04,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 1944 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 22:02:04,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13747 states. [2025-02-05 22:02:05,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13747 to 13742. [2025-02-05 22:02:05,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13742 states, 12449 states have (on average 1.5849465820547834) internal successors, (19731), 12471 states have internal predecessors, (19731), 1222 states have call successors, (1222), 70 states have call predecessors, (1222), 70 states have return successors, (1222), 1200 states have call predecessors, (1222), 1222 states have call successors, (1222) [2025-02-05 22:02:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13742 states to 13742 states and 22175 transitions. [2025-02-05 22:02:05,060 INFO L78 Accepts]: Start accepts. Automaton has 13742 states and 22175 transitions. Word has length 574 [2025-02-05 22:02:05,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:05,061 INFO L471 AbstractCegarLoop]: Abstraction has 13742 states and 22175 transitions. [2025-02-05 22:02:05,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:02:05,061 INFO L276 IsEmpty]: Start isEmpty. Operand 13742 states and 22175 transitions. [2025-02-05 22:02:05,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-02-05 22:02:05,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:05,072 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:05,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 22:02:05,073 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:05,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:05,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1096974893, now seen corresponding path program 1 times [2025-02-05 22:02:05,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:05,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149453693] [2025-02-05 22:02:05,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:05,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:05,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-02-05 22:02:05,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-02-05 22:02:05,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:05,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:05,559 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:02:05,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:05,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149453693] [2025-02-05 22:02:05,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149453693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:05,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:05,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:02:05,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381464] [2025-02-05 22:02:05,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:05,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:02:05,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:05,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:02:05,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:02:05,562 INFO L87 Difference]: Start difference. First operand 13742 states and 22175 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:02:06,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:06,232 INFO L93 Difference]: Finished difference Result 20218 states and 32865 transitions. [2025-02-05 22:02:06,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:02:06,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 575 [2025-02-05 22:02:06,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:06,267 INFO L225 Difference]: With dead ends: 20218 [2025-02-05 22:02:06,268 INFO L226 Difference]: Without dead ends: 16025 [2025-02-05 22:02:06,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-05 22:02:06,277 INFO L435 NwaCegarLoop]: 574 mSDtfsCounter, 307 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:06,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 1038 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:02:06,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16025 states. [2025-02-05 22:02:06,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16025 to 15757. [2025-02-05 22:02:06,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15757 states, 14262 states have (on average 1.5880661898751929) internal successors, (22649), 14286 states have internal predecessors, (22649), 1412 states have call successors, (1412), 82 states have call predecessors, (1412), 82 states have return successors, (1412), 1388 states have call predecessors, (1412), 1412 states have call successors, (1412) [2025-02-05 22:02:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15757 states to 15757 states and 25473 transitions. [2025-02-05 22:02:06,909 INFO L78 Accepts]: Start accepts. Automaton has 15757 states and 25473 transitions. Word has length 575 [2025-02-05 22:02:06,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:06,909 INFO L471 AbstractCegarLoop]: Abstraction has 15757 states and 25473 transitions. [2025-02-05 22:02:06,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:02:06,910 INFO L276 IsEmpty]: Start isEmpty. Operand 15757 states and 25473 transitions. [2025-02-05 22:02:06,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-02-05 22:02:06,917 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:06,917 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:06,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 22:02:06,918 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:06,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:06,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1272459092, now seen corresponding path program 1 times [2025-02-05 22:02:06,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:06,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29553632] [2025-02-05 22:02:06,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:06,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:06,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-02-05 22:02:07,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-02-05 22:02:07,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:07,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:07,927 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:02:07,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:07,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29553632] [2025-02-05 22:02:07,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29553632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:07,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:07,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 22:02:07,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317295270] [2025-02-05 22:02:07,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:07,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:02:07,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:07,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:02:07,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:02:07,930 INFO L87 Difference]: Start difference. First operand 15757 states and 25473 transitions. Second operand has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 2 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) [2025-02-05 22:02:11,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:11,193 INFO L93 Difference]: Finished difference Result 31245 states and 49831 transitions. [2025-02-05 22:02:11,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 22:02:11,193 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 2 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) Word has length 575 [2025-02-05 22:02:11,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:11,240 INFO L225 Difference]: With dead ends: 31245 [2025-02-05 22:02:11,240 INFO L226 Difference]: Without dead ends: 25078 [2025-02-05 22:02:11,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-05 22:02:11,251 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 1354 mSDsluCounter, 4402 mSDsCounter, 0 mSdLazyCounter, 1988 mSolverCounterSat, 590 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 4916 SdHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 590 IncrementalHoareTripleChecker+Valid, 1988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:11,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 4916 Invalid, 2578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [590 Valid, 1988 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 22:02:11,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25078 states. [2025-02-05 22:02:12,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25078 to 23180. [2025-02-05 22:02:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23180 states, 20341 states have (on average 1.5443685167887518) internal successors, (31414), 20394 states have internal predecessors, (31414), 2685 states have call successors, (2685), 153 states have call predecessors, (2685), 153 states have return successors, (2685), 2632 states have call predecessors, (2685), 2685 states have call successors, (2685) [2025-02-05 22:02:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23180 states to 23180 states and 36784 transitions. [2025-02-05 22:02:12,728 INFO L78 Accepts]: Start accepts. Automaton has 23180 states and 36784 transitions. Word has length 575 [2025-02-05 22:02:12,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:12,729 INFO L471 AbstractCegarLoop]: Abstraction has 23180 states and 36784 transitions. [2025-02-05 22:02:12,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.555555555555557) internal successors, (158), 9 states have internal predecessors, (158), 2 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84) [2025-02-05 22:02:12,729 INFO L276 IsEmpty]: Start isEmpty. Operand 23180 states and 36784 transitions. [2025-02-05 22:02:12,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-02-05 22:02:12,739 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:12,740 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:12,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 22:02:12,740 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:12,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:12,741 INFO L85 PathProgramCache]: Analyzing trace with hash -737644749, now seen corresponding path program 1 times [2025-02-05 22:02:12,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:12,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977838164] [2025-02-05 22:02:12,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:12,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:12,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-02-05 22:02:12,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-02-05 22:02:12,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:12,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:13,031 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:02:13,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:13,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977838164] [2025-02-05 22:02:13,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977838164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:13,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:13,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:02:13,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735678336] [2025-02-05 22:02:13,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:13,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:02:13,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:13,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:02:13,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:02:13,034 INFO L87 Difference]: Start difference. First operand 23180 states and 36784 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:02:16,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:16,677 INFO L93 Difference]: Finished difference Result 76618 states and 121144 transitions. [2025-02-05 22:02:16,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:02:16,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 575 [2025-02-05 22:02:16,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:16,814 INFO L225 Difference]: With dead ends: 76618 [2025-02-05 22:02:16,814 INFO L226 Difference]: Without dead ends: 53625 [2025-02-05 22:02:16,852 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-02-05 22:02:16,853 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 814 mSDsluCounter, 1433 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 2378 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:16,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 2378 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:02:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53625 states. [2025-02-05 22:02:18,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53625 to 23180. [2025-02-05 22:02:18,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23180 states, 20341 states have (on average 1.5433852809596382) internal successors, (31394), 20394 states have internal predecessors, (31394), 2685 states have call successors, (2685), 153 states have call predecessors, (2685), 153 states have return successors, (2685), 2632 states have call predecessors, (2685), 2685 states have call successors, (2685) [2025-02-05 22:02:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23180 states to 23180 states and 36764 transitions. [2025-02-05 22:02:19,113 INFO L78 Accepts]: Start accepts. Automaton has 23180 states and 36764 transitions. Word has length 575 [2025-02-05 22:02:19,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:19,114 INFO L471 AbstractCegarLoop]: Abstraction has 23180 states and 36764 transitions. [2025-02-05 22:02:19,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:02:19,114 INFO L276 IsEmpty]: Start isEmpty. Operand 23180 states and 36764 transitions. [2025-02-05 22:02:19,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-02-05 22:02:19,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:19,124 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:19,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 22:02:19,124 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:19,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:19,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1734717102, now seen corresponding path program 1 times [2025-02-05 22:02:19,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:19,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049391613] [2025-02-05 22:02:19,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:19,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:19,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-02-05 22:02:19,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-02-05 22:02:19,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:19,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:02:20,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:20,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049391613] [2025-02-05 22:02:20,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049391613] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:20,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:20,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 22:02:20,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815718806] [2025-02-05 22:02:20,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:20,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 22:02:20,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:20,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 22:02:20,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-05 22:02:20,313 INFO L87 Difference]: Start difference. First operand 23180 states and 36764 transitions. Second operand has 13 states, 13 states have (on average 12.153846153846153) internal successors, (158), 13 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:02:30,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:30,339 INFO L93 Difference]: Finished difference Result 67485 states and 107311 transitions. [2025-02-05 22:02:30,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-05 22:02:30,340 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.153846153846153) internal successors, (158), 13 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 575 [2025-02-05 22:02:30,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:30,450 INFO L225 Difference]: With dead ends: 67485 [2025-02-05 22:02:30,450 INFO L226 Difference]: Without dead ends: 56978 [2025-02-05 22:02:30,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=398, Invalid=1162, Unknown=0, NotChecked=0, Total=1560 [2025-02-05 22:02:30,471 INFO L435 NwaCegarLoop]: 1017 mSDtfsCounter, 7131 mSDsluCounter, 5126 mSDsCounter, 0 mSdLazyCounter, 4500 mSolverCounterSat, 2868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7131 SdHoareTripleChecker+Valid, 6143 SdHoareTripleChecker+Invalid, 7368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2868 IncrementalHoareTripleChecker+Valid, 4500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:30,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7131 Valid, 6143 Invalid, 7368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2868 Valid, 4500 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-02-05 22:02:30,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56978 states. [2025-02-05 22:02:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56978 to 38608. [2025-02-05 22:02:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38608 states, 33950 states have (on average 1.5569661266568484) internal successors, (52859), 34033 states have internal predecessors, (52859), 4371 states have call successors, (4371), 286 states have call predecessors, (4371), 286 states have return successors, (4371), 4288 states have call predecessors, (4371), 4371 states have call successors, (4371) [2025-02-05 22:02:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38608 states to 38608 states and 61601 transitions. [2025-02-05 22:02:33,021 INFO L78 Accepts]: Start accepts. Automaton has 38608 states and 61601 transitions. Word has length 575 [2025-02-05 22:02:33,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:33,021 INFO L471 AbstractCegarLoop]: Abstraction has 38608 states and 61601 transitions. [2025-02-05 22:02:33,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.153846153846153) internal successors, (158), 13 states have internal predecessors, (158), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 22:02:33,021 INFO L276 IsEmpty]: Start isEmpty. Operand 38608 states and 61601 transitions. [2025-02-05 22:02:33,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2025-02-05 22:02:33,038 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:33,038 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:33,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 22:02:33,038 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:33,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:33,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1714379727, now seen corresponding path program 1 times [2025-02-05 22:02:33,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:33,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429837240] [2025-02-05 22:02:33,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:33,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:33,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-02-05 22:02:33,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-02-05 22:02:33,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:33,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 129 proven. 120 refuted. 0 times theorem prover too weak. 13695 trivial. 0 not checked. [2025-02-05 22:02:33,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:33,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429837240] [2025-02-05 22:02:33,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429837240] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:02:33,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951868909] [2025-02-05 22:02:33,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:33,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:02:33,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:02:33,515 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:02:33,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 22:02:33,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 575 statements into 1 equivalence classes. [2025-02-05 22:02:33,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 575 of 575 statements. [2025-02-05 22:02:33,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:33,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:33,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 1340 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 22:02:33,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:02:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 4505 proven. 48 refuted. 0 times theorem prover too weak. 9391 trivial. 0 not checked. [2025-02-05 22:02:34,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:02:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 201 proven. 48 refuted. 0 times theorem prover too weak. 13695 trivial. 0 not checked. [2025-02-05 22:02:34,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951868909] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:02:34,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:02:34,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-02-05 22:02:34,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571792756] [2025-02-05 22:02:34,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:02:34,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:02:34,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:34,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:02:34,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:02:34,400 INFO L87 Difference]: Start difference. First operand 38608 states and 61601 transitions. Second operand has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 4 states have call successors, (140), 2 states have call predecessors, (140), 4 states have return successors, (142), 4 states have call predecessors, (142), 4 states have call successors, (142) [2025-02-05 22:02:35,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:02:35,526 INFO L93 Difference]: Finished difference Result 51300 states and 81360 transitions. [2025-02-05 22:02:35,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 22:02:35,527 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 4 states have call successors, (140), 2 states have call predecessors, (140), 4 states have return successors, (142), 4 states have call predecessors, (142), 4 states have call successors, (142) Word has length 575 [2025-02-05 22:02:35,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:02:35,570 INFO L225 Difference]: With dead ends: 51300 [2025-02-05 22:02:35,570 INFO L226 Difference]: Without dead ends: 12819 [2025-02-05 22:02:35,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1162 GetRequests, 1147 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:02:35,615 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 534 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:02:35,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 941 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:02:35,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12819 states. [2025-02-05 22:02:36,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12819 to 12671. [2025-02-05 22:02:36,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12671 states, 11079 states have (on average 1.4785630472064266) internal successors, (16381), 11108 states have internal predecessors, (16381), 1484 states have call successors, (1484), 107 states have call predecessors, (1484), 107 states have return successors, (1484), 1455 states have call predecessors, (1484), 1484 states have call successors, (1484) [2025-02-05 22:02:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12671 states to 12671 states and 19349 transitions. [2025-02-05 22:02:36,653 INFO L78 Accepts]: Start accepts. Automaton has 12671 states and 19349 transitions. Word has length 575 [2025-02-05 22:02:36,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:02:36,654 INFO L471 AbstractCegarLoop]: Abstraction has 12671 states and 19349 transitions. [2025-02-05 22:02:36,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.666666666666664) internal successors, (312), 9 states have internal predecessors, (312), 4 states have call successors, (140), 2 states have call predecessors, (140), 4 states have return successors, (142), 4 states have call predecessors, (142), 4 states have call successors, (142) [2025-02-05 22:02:36,654 INFO L276 IsEmpty]: Start isEmpty. Operand 12671 states and 19349 transitions. [2025-02-05 22:02:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2025-02-05 22:02:36,664 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:02:36,664 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 22:02:36,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 22:02:36,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:02:36,865 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:02:36,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:02:36,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1509811926, now seen corresponding path program 1 times [2025-02-05 22:02:36,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:02:36,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716609600] [2025-02-05 22:02:36,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:02:36,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:02:36,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 577 statements into 1 equivalence classes. [2025-02-05 22:02:37,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 577 of 577 statements. [2025-02-05 22:02:37,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:02:37,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:02:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 22:02:39,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:02:39,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716609600] [2025-02-05 22:02:39,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716609600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:02:39,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:02:39,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 22:02:39,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641559582] [2025-02-05 22:02:39,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:02:39,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 22:02:39,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:02:39,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 22:02:39,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-02-05 22:02:39,231 INFO L87 Difference]: Start difference. First operand 12671 states and 19349 transitions. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 13 states have internal predecessors, (160), 2 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 2 states have call predecessors, (84), 2 states have call successors, (84)