./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-21.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-21.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6343a1465750afdc947de8e9ff805a9cfece8acd0c6031287a1734d8c4b949b9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:44:44,482 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:44:44,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:44:44,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:44:44,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:44:44,580 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:44:44,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:44:44,581 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:44:44,581 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:44:44,581 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:44:44,581 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:44:44,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:44:44,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:44:44,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:44:44,582 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:44:44,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:44:44,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:44:44,582 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:44:44,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:44:44,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:44:44,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:44:44,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:44:44,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:44:44,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:44:44,582 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:44:44,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:44:44,583 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:44:44,583 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:44:44,583 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:44:44,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:44:44,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:44:44,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:44:44,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:44:44,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:44:44,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:44:44,584 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:44:44,584 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:44:44,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:44:44,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:44:44,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:44:44,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:44:44,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:44:44,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:44:44,584 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6343a1465750afdc947de8e9ff805a9cfece8acd0c6031287a1734d8c4b949b9 [2025-03-03 19:44:44,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:44:44,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:44:44,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:44:44,812 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:44:44,812 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:44:44,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-21.i [2025-03-03 19:44:45,938 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7562d68cb/73fa410153c344e4a16dee62868eb765/FLAGa8678987b [2025-03-03 19:44:46,233 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:44:46,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-21.i [2025-03-03 19:44:46,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7562d68cb/73fa410153c344e4a16dee62868eb765/FLAGa8678987b [2025-03-03 19:44:46,262 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7562d68cb/73fa410153c344e4a16dee62868eb765 [2025-03-03 19:44:46,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:44:46,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:44:46,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:44:46,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:44:46,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:44:46,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:44:46" (1/1) ... [2025-03-03 19:44:46,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e79afff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:46, skipping insertion in model container [2025-03-03 19:44:46,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:44:46" (1/1) ... [2025-03-03 19:44:46,302 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:44:46,406 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-21.i[916,929] [2025-03-03 19:44:46,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:44:46,530 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:44:46,539 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-21.i[916,929] [2025-03-03 19:44:46,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:44:46,600 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:44:46,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:46 WrapperNode [2025-03-03 19:44:46,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:44:46,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:44:46,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:44:46,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:44:46,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:46" (1/1) ... [2025-03-03 19:44:46,617 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:46" (1/1) ... [2025-03-03 19:44:46,660 INFO L138 Inliner]: procedures = 26, calls = 99, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 657 [2025-03-03 19:44:46,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:44:46,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:44:46,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:44:46,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:44:46,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:46" (1/1) ... [2025-03-03 19:44:46,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:46" (1/1) ... [2025-03-03 19:44:46,679 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:46" (1/1) ... [2025-03-03 19:44:46,705 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 19:44:46,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:46" (1/1) ... [2025-03-03 19:44:46,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:46" (1/1) ... [2025-03-03 19:44:46,721 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:46" (1/1) ... [2025-03-03 19:44:46,728 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:46" (1/1) ... [2025-03-03 19:44:46,731 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:46" (1/1) ... [2025-03-03 19:44:46,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:46" (1/1) ... [2025-03-03 19:44:46,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:44:46,747 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:44:46,748 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:44:46,748 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:44:46,749 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:46" (1/1) ... [2025-03-03 19:44:46,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:44:46,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:44:46,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 19:44:46,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 19:44:46,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:44:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:44:46,797 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:44:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:44:46,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:44:46,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:44:46,903 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:44:46,905 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:44:47,640 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L471: havoc property_#t~ite70#1;havoc property_#t~bitwise69#1;havoc property_#t~short71#1; [2025-03-03 19:44:47,743 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-03 19:44:47,743 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:44:47,773 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:44:47,778 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-03 19:44:47,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:44:47 BoogieIcfgContainer [2025-03-03 19:44:47,778 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:44:47,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:44:47,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:44:47,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:44:47,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:44:46" (1/3) ... [2025-03-03 19:44:47,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170c3fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:44:47, skipping insertion in model container [2025-03-03 19:44:47,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:44:46" (2/3) ... [2025-03-03 19:44:47,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@170c3fba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:44:47, skipping insertion in model container [2025-03-03 19:44:47,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:44:47" (3/3) ... [2025-03-03 19:44:47,786 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-21.i [2025-03-03 19:44:47,797 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:44:47,799 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-21.i that has 2 procedures, 270 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:44:47,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:44:47,857 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;@7afd5552, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:44:47,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:44:47,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 270 states, 181 states have (on average 1.5248618784530388) internal successors, (276), 182 states have internal predecessors, (276), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 19:44:47,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-03 19:44:47,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:47,887 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:44:47,887 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:47,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:47,892 INFO L85 PathProgramCache]: Analyzing trace with hash -889263822, now seen corresponding path program 1 times [2025-03-03 19:44:47,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:47,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249453064] [2025-03-03 19:44:47,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:47,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:48,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-03 19:44:48,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-03 19:44:48,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:48,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2025-03-03 19:44:48,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:48,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249453064] [2025-03-03 19:44:48,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249453064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:44:48,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98732949] [2025-03-03 19:44:48,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:48,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:44:48,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:44:48,387 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:44:48,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 19:44:48,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-03 19:44:48,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-03 19:44:48,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:48,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:48,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:44:48,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:44:48,723 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2025-03-03 19:44:48,724 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:44:48,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98732949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:44:48,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:44:48,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:44:48,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869806660] [2025-03-03 19:44:48,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:44:48,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:44:48,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:48,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:44:48,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:44:48,751 INFO L87 Difference]: Start difference. First operand has 270 states, 181 states have (on average 1.5248618784530388) internal successors, (276), 182 states have internal predecessors, (276), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-03 19:44:48,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:48,817 INFO L93 Difference]: Finished difference Result 523 states and 958 transitions. [2025-03-03 19:44:48,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:44:48,820 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) Word has length 535 [2025-03-03 19:44:48,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:48,832 INFO L225 Difference]: With dead ends: 523 [2025-03-03 19:44:48,832 INFO L226 Difference]: Without dead ends: 256 [2025-03-03 19:44:48,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 536 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:44:48,841 INFO L435 NwaCegarLoop]: 411 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, 411 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-03-03 19:44:48,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 411 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:44:48,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-03 19:44:48,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2025-03-03 19:44:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 168 states have (on average 1.494047619047619) internal successors, (251), 168 states have internal predecessors, (251), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-03 19:44:48,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 423 transitions. [2025-03-03 19:44:48,916 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 423 transitions. Word has length 535 [2025-03-03 19:44:48,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:48,918 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 423 transitions. [2025-03-03 19:44:48,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-03 19:44:48,919 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 423 transitions. [2025-03-03 19:44:48,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-03-03 19:44:48,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:48,929 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:44:48,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 19:44:49,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:44:49,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:49,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:49,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1502259466, now seen corresponding path program 1 times [2025-03-03 19:44:49,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:49,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129344686] [2025-03-03 19:44:49,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:49,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:49,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-03-03 19:44:49,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-03-03 19:44:49,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:49,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:44:49,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:49,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129344686] [2025-03-03 19:44:49,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129344686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:44:49,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:44:49,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:44:49,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915811196] [2025-03-03 19:44:49,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:44:49,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:44:49,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:49,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:44:49,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:44:49,907 INFO L87 Difference]: Start difference. First operand 256 states and 423 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-03 19:44:50,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:50,198 INFO L93 Difference]: Finished difference Result 762 states and 1263 transitions. [2025-03-03 19:44:50,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:44:50,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) Word has length 535 [2025-03-03 19:44:50,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:50,205 INFO L225 Difference]: With dead ends: 762 [2025-03-03 19:44:50,208 INFO L226 Difference]: Without dead ends: 509 [2025-03-03 19:44:50,210 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-03-03 19:44:50,211 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 524 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:50,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 920 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:44:50,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-03 19:44:50,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 507. [2025-03-03 19:44:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 332 states have (on average 1.4969879518072289) internal successors, (497), 332 states have internal predecessors, (497), 172 states have call successors, (172), 2 states have call predecessors, (172), 2 states have return successors, (172), 172 states have call predecessors, (172), 172 states have call successors, (172) [2025-03-03 19:44:50,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 841 transitions. [2025-03-03 19:44:50,327 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 841 transitions. Word has length 535 [2025-03-03 19:44:50,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:50,329 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 841 transitions. [2025-03-03 19:44:50,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-03 19:44:50,330 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 841 transitions. [2025-03-03 19:44:50,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-03 19:44:50,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:50,341 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:44:50,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:44:50,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:50,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:50,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1513746887, now seen corresponding path program 1 times [2025-03-03 19:44:50,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:50,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632224982] [2025-03-03 19:44:50,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:50,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:50,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-03 19:44:50,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-03 19:44:50,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:50,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:50,609 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:44:50,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:50,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632224982] [2025-03-03 19:44:50,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632224982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:44:50,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:44:50,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:44:50,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536391494] [2025-03-03 19:44:50,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:44:50,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:44:50,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:50,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:44:50,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:44:50,612 INFO L87 Difference]: Start difference. First operand 507 states and 841 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:44:50,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:50,725 INFO L93 Difference]: Finished difference Result 1255 states and 2080 transitions. [2025-03-03 19:44:50,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:44:50,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 536 [2025-03-03 19:44:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:50,737 INFO L225 Difference]: With dead ends: 1255 [2025-03-03 19:44:50,738 INFO L226 Difference]: Without dead ends: 751 [2025-03-03 19:44:50,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:44:50,742 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 224 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:50,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 930 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:44:50,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-03-03 19:44:50,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 746. [2025-03-03 19:44:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 525 states have (on average 1.5238095238095237) internal successors, (800), 527 states have internal predecessors, (800), 216 states have call successors, (216), 4 states have call predecessors, (216), 4 states have return successors, (216), 214 states have call predecessors, (216), 216 states have call successors, (216) [2025-03-03 19:44:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1232 transitions. [2025-03-03 19:44:50,843 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1232 transitions. Word has length 536 [2025-03-03 19:44:50,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:50,844 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1232 transitions. [2025-03-03 19:44:50,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:44:50,844 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1232 transitions. [2025-03-03 19:44:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-03 19:44:50,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:50,851 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:44:50,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:44:50,851 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:50,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:50,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1620408934, now seen corresponding path program 1 times [2025-03-03 19:44:50,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:50,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528271099] [2025-03-03 19:44:50,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:50,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:50,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-03 19:44:50,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-03 19:44:50,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:50,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:51,126 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:44:51,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:51,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528271099] [2025-03-03 19:44:51,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528271099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:44:51,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:44:51,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:44:51,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938733309] [2025-03-03 19:44:51,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:44:51,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:44:51,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:51,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:44:51,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:44:51,128 INFO L87 Difference]: Start difference. First operand 746 states and 1232 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:44:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:51,434 INFO L93 Difference]: Finished difference Result 1741 states and 2870 transitions. [2025-03-03 19:44:51,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:44:51,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 536 [2025-03-03 19:44:51,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:51,444 INFO L225 Difference]: With dead ends: 1741 [2025-03-03 19:44:51,444 INFO L226 Difference]: Without dead ends: 998 [2025-03-03 19:44:51,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:44:51,448 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 600 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:51,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1448 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:44:51,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-03-03 19:44:51,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 992. [2025-03-03 19:44:51,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 711 states have (on average 1.528832630098453) internal successors, (1087), 715 states have internal predecessors, (1087), 274 states have call successors, (274), 6 states have call predecessors, (274), 6 states have return successors, (274), 270 states have call predecessors, (274), 274 states have call successors, (274) [2025-03-03 19:44:51,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1635 transitions. [2025-03-03 19:44:51,535 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1635 transitions. Word has length 536 [2025-03-03 19:44:51,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:51,537 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1635 transitions. [2025-03-03 19:44:51,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:44:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1635 transitions. [2025-03-03 19:44:51,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-03 19:44:51,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:51,546 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:44:51,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:44:51,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:51,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:51,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1522512232, now seen corresponding path program 1 times [2025-03-03 19:44:51,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:51,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730524682] [2025-03-03 19:44:51,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:51,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:51,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-03 19:44:51,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-03 19:44:51,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:51,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:44:51,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:51,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730524682] [2025-03-03 19:44:51,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730524682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:44:51,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:44:51,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:44:51,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032389730] [2025-03-03 19:44:51,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:44:51,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:44:51,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:51,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:44:51,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:44:51,717 INFO L87 Difference]: Start difference. First operand 992 states and 1635 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:44:51,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:51,802 INFO L93 Difference]: Finished difference Result 2070 states and 3408 transitions. [2025-03-03 19:44:51,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:44:51,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 536 [2025-03-03 19:44:51,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:51,809 INFO L225 Difference]: With dead ends: 2070 [2025-03-03 19:44:51,810 INFO L226 Difference]: Without dead ends: 1081 [2025-03-03 19:44:51,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:44:51,813 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 191 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:51,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 840 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:44:51,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2025-03-03 19:44:51,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 884. [2025-03-03 19:44:51,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 669 states have (on average 1.5784753363228698) internal successors, (1056), 670 states have internal predecessors, (1056), 208 states have call successors, (208), 6 states have call predecessors, (208), 6 states have return successors, (208), 207 states have call predecessors, (208), 208 states have call successors, (208) [2025-03-03 19:44:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1472 transitions. [2025-03-03 19:44:51,860 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1472 transitions. Word has length 536 [2025-03-03 19:44:51,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:51,861 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 1472 transitions. [2025-03-03 19:44:51,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:44:51,861 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1472 transitions. [2025-03-03 19:44:51,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-03 19:44:51,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:51,867 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:44:51,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:44:51,867 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:51,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:51,867 INFO L85 PathProgramCache]: Analyzing trace with hash 525439879, now seen corresponding path program 1 times [2025-03-03 19:44:51,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:51,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251632360] [2025-03-03 19:44:51,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:51,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:51,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-03 19:44:51,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-03 19:44:51,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:51,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:44:52,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:52,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251632360] [2025-03-03 19:44:52,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251632360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:44:52,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:44:52,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:44:52,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083480926] [2025-03-03 19:44:52,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:44:52,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:44:52,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:52,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:44:52,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:44:52,095 INFO L87 Difference]: Start difference. First operand 884 states and 1472 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:44:52,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:52,420 INFO L93 Difference]: Finished difference Result 2446 states and 4019 transitions. [2025-03-03 19:44:52,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:44:52,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 536 [2025-03-03 19:44:52,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:52,431 INFO L225 Difference]: With dead ends: 2446 [2025-03-03 19:44:52,431 INFO L226 Difference]: Without dead ends: 1565 [2025-03-03 19:44:52,434 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-03-03 19:44:52,435 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 505 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:52,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 1059 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:44:52,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2025-03-03 19:44:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1364. [2025-03-03 19:44:52,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1023 states have (on average 1.5425219941348973) internal successors, (1578), 1027 states have internal predecessors, (1578), 328 states have call successors, (328), 12 states have call predecessors, (328), 12 states have return successors, (328), 324 states have call predecessors, (328), 328 states have call successors, (328) [2025-03-03 19:44:52,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2234 transitions. [2025-03-03 19:44:52,516 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2234 transitions. Word has length 536 [2025-03-03 19:44:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:52,517 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 2234 transitions. [2025-03-03 19:44:52,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:44:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2234 transitions. [2025-03-03 19:44:52,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-03 19:44:52,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:52,520 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:44:52,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:44:52,521 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:52,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:52,521 INFO L85 PathProgramCache]: Analyzing trace with hash 649513126, now seen corresponding path program 1 times [2025-03-03 19:44:52,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:52,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227236009] [2025-03-03 19:44:52,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:52,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:52,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-03 19:44:52,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-03 19:44:52,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:52,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:52,876 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:44:52,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:52,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227236009] [2025-03-03 19:44:52,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227236009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:44:52,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:44:52,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:44:52,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037592934] [2025-03-03 19:44:52,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:44:52,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:44:52,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:52,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:44:52,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:44:52,878 INFO L87 Difference]: Start difference. First operand 1364 states and 2234 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-03 19:44:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:53,165 INFO L93 Difference]: Finished difference Result 2729 states and 4469 transitions. [2025-03-03 19:44:53,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:44:53,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) Word has length 536 [2025-03-03 19:44:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:53,174 INFO L225 Difference]: With dead ends: 2729 [2025-03-03 19:44:53,174 INFO L226 Difference]: Without dead ends: 1368 [2025-03-03 19:44:53,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:44:53,178 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 543 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:53,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1262 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:44:53,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2025-03-03 19:44:53,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1365. [2025-03-03 19:44:53,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1024 states have (on average 1.5419921875) internal successors, (1579), 1028 states have internal predecessors, (1579), 328 states have call successors, (328), 12 states have call predecessors, (328), 12 states have return successors, (328), 324 states have call predecessors, (328), 328 states have call successors, (328) [2025-03-03 19:44:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2235 transitions. [2025-03-03 19:44:53,255 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2235 transitions. Word has length 536 [2025-03-03 19:44:53,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:53,256 INFO L471 AbstractCegarLoop]: Abstraction has 1365 states and 2235 transitions. [2025-03-03 19:44:53,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-03 19:44:53,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2235 transitions. [2025-03-03 19:44:53,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-03 19:44:53,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:53,260 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:44:53,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:44:53,261 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:53,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:53,261 INFO L85 PathProgramCache]: Analyzing trace with hash -533834171, now seen corresponding path program 1 times [2025-03-03 19:44:53,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:53,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124069580] [2025-03-03 19:44:53,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:53,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:53,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-03 19:44:53,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-03 19:44:53,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:53,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:44:53,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:53,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124069580] [2025-03-03 19:44:53,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124069580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:44:53,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:44:53,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:44:53,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499041391] [2025-03-03 19:44:53,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:44:53,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:44:53,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:53,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:44:53,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:44:53,821 INFO L87 Difference]: Start difference. First operand 1365 states and 2235 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:44:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:54,010 INFO L93 Difference]: Finished difference Result 4089 states and 6699 transitions. [2025-03-03 19:44:54,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:44:54,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 536 [2025-03-03 19:44:54,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:54,025 INFO L225 Difference]: With dead ends: 4089 [2025-03-03 19:44:54,026 INFO L226 Difference]: Without dead ends: 2727 [2025-03-03 19:44:54,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:44:54,031 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 263 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:54,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 938 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:44:54,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2025-03-03 19:44:54,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2701. [2025-03-03 19:44:54,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 2020 states have (on average 1.5371287128712872) internal successors, (3105), 2028 states have internal predecessors, (3105), 656 states have call successors, (656), 24 states have call predecessors, (656), 24 states have return successors, (656), 648 states have call predecessors, (656), 656 states have call successors, (656) [2025-03-03 19:44:54,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 4417 transitions. [2025-03-03 19:44:54,208 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 4417 transitions. Word has length 536 [2025-03-03 19:44:54,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:54,209 INFO L471 AbstractCegarLoop]: Abstraction has 2701 states and 4417 transitions. [2025-03-03 19:44:54,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:44:54,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 4417 transitions. [2025-03-03 19:44:54,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-03 19:44:54,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:54,214 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:44:54,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:44:54,215 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:54,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:54,215 INFO L85 PathProgramCache]: Analyzing trace with hash 734343146, now seen corresponding path program 1 times [2025-03-03 19:44:54,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:54,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157700518] [2025-03-03 19:44:54,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:54,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:54,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-03 19:44:54,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-03 19:44:54,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:54,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:44:54,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:54,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157700518] [2025-03-03 19:44:54,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157700518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:44:54,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:44:54,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:44:54,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099392549] [2025-03-03 19:44:54,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:44:54,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:44:54,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:54,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:44:54,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:44:54,551 INFO L87 Difference]: Start difference. First operand 2701 states and 4417 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:44:55,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:55,380 INFO L93 Difference]: Finished difference Result 5617 states and 9079 transitions. [2025-03-03 19:44:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:44:55,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 537 [2025-03-03 19:44:55,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:55,404 INFO L225 Difference]: With dead ends: 5617 [2025-03-03 19:44:55,404 INFO L226 Difference]: Without dead ends: 4589 [2025-03-03 19:44:55,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:44:55,409 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 1331 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:55,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 1254 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:44:55,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4589 states. [2025-03-03 19:44:55,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4589 to 3141. [2025-03-03 19:44:55,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 2348 states have (on average 1.528534923339012) internal successors, (3589), 2360 states have internal predecessors, (3589), 760 states have call successors, (760), 32 states have call predecessors, (760), 32 states have return successors, (760), 748 states have call predecessors, (760), 760 states have call successors, (760) [2025-03-03 19:44:55,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 5109 transitions. [2025-03-03 19:44:55,684 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 5109 transitions. Word has length 537 [2025-03-03 19:44:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:55,685 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 5109 transitions. [2025-03-03 19:44:55,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:44:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 5109 transitions. [2025-03-03 19:44:55,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-03 19:44:55,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:55,690 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:44:55,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 19:44:55,690 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:55,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:55,691 INFO L85 PathProgramCache]: Analyzing trace with hash -290350775, now seen corresponding path program 1 times [2025-03-03 19:44:55,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:55,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429152266] [2025-03-03 19:44:55,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:55,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:55,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-03 19:44:55,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-03 19:44:55,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:55,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:56,130 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:44:56,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:56,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429152266] [2025-03-03 19:44:56,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429152266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:44:56,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:44:56,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:44:56,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532573772] [2025-03-03 19:44:56,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:44:56,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:44:56,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:56,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:44:56,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:44:56,133 INFO L87 Difference]: Start difference. First operand 3141 states and 5109 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:44:56,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:56,586 INFO L93 Difference]: Finished difference Result 4390 states and 7114 transitions. [2025-03-03 19:44:56,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:44:56,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 537 [2025-03-03 19:44:56,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:56,603 INFO L225 Difference]: With dead ends: 4390 [2025-03-03 19:44:56,603 INFO L226 Difference]: Without dead ends: 3647 [2025-03-03 19:44:56,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:44:56,608 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 823 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:56,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 998 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:44:56,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3647 states. [2025-03-03 19:44:56,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3647 to 3146. [2025-03-03 19:44:56,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3146 states, 2353 states have (on average 1.5291117722056948) internal successors, (3598), 2365 states have internal predecessors, (3598), 760 states have call successors, (760), 32 states have call predecessors, (760), 32 states have return successors, (760), 748 states have call predecessors, (760), 760 states have call successors, (760) [2025-03-03 19:44:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3146 states to 3146 states and 5118 transitions. [2025-03-03 19:44:56,828 INFO L78 Accepts]: Start accepts. Automaton has 3146 states and 5118 transitions. Word has length 537 [2025-03-03 19:44:56,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:56,829 INFO L471 AbstractCegarLoop]: Abstraction has 3146 states and 5118 transitions. [2025-03-03 19:44:56,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:44:56,830 INFO L276 IsEmpty]: Start isEmpty. Operand 3146 states and 5118 transitions. [2025-03-03 19:44:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-03 19:44:56,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:56,834 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:44:56,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 19:44:56,835 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:56,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:56,835 INFO L85 PathProgramCache]: Analyzing trace with hash -966397333, now seen corresponding path program 1 times [2025-03-03 19:44:56,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:56,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758566930] [2025-03-03 19:44:56,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:56,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:56,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-03 19:44:56,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-03 19:44:56,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:56,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:44:57,111 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:44:57,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:44:57,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758566930] [2025-03-03 19:44:57,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758566930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:44:57,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:44:57,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:44:57,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103121149] [2025-03-03 19:44:57,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:44:57,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:44:57,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:44:57,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:44:57,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:44:57,112 INFO L87 Difference]: Start difference. First operand 3146 states and 5118 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:44:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:58,840 INFO L93 Difference]: Finished difference Result 15754 states and 25530 transitions. [2025-03-03 19:44:58,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 19:44:58,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 537 [2025-03-03 19:44:58,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:58,913 INFO L225 Difference]: With dead ends: 15754 [2025-03-03 19:44:58,913 INFO L226 Difference]: Without dead ends: 13442 [2025-03-03 19:44:58,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:44:58,929 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 1822 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1822 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:58,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1822 Valid, 2211 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 19:44:58,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13442 states. [2025-03-03 19:44:59,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13442 to 8930. [2025-03-03 19:44:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8930 states, 6873 states have (on average 1.5437218099810854) internal successors, (10610), 6913 states have internal predecessors, (10610), 1960 states have call successors, (1960), 96 states have call predecessors, (1960), 96 states have return successors, (1960), 1920 states have call predecessors, (1960), 1960 states have call successors, (1960) [2025-03-03 19:44:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8930 states to 8930 states and 14530 transitions. [2025-03-03 19:44:59,503 INFO L78 Accepts]: Start accepts. Automaton has 8930 states and 14530 transitions. Word has length 537 [2025-03-03 19:44:59,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:59,504 INFO L471 AbstractCegarLoop]: Abstraction has 8930 states and 14530 transitions. [2025-03-03 19:44:59,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:44:59,505 INFO L276 IsEmpty]: Start isEmpty. Operand 8930 states and 14530 transitions. [2025-03-03 19:44:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-03 19:44:59,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:59,513 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:44:59,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 19:44:59,514 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:59,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:59,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1392909676, now seen corresponding path program 1 times [2025-03-03 19:44:59,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:59,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655565311] [2025-03-03 19:44:59,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:59,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:59,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-03 19:44:59,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-03 19:44:59,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:59,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:02,413 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:45:02,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:02,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655565311] [2025-03-03 19:45:02,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655565311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:02,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:02,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 19:45:02,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591549968] [2025-03-03 19:45:02,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:02,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 19:45:02,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:02,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 19:45:02,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:45:02,416 INFO L87 Difference]: Start difference. First operand 8930 states and 14530 transitions. Second operand has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 12 states have internal predecessors, (110), 3 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 3 states have call predecessors, (86), 3 states have call successors, (86) [2025-03-03 19:45:09,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:09,396 INFO L93 Difference]: Finished difference Result 27010 states and 43833 transitions. [2025-03-03 19:45:09,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 19:45:09,397 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 12 states have internal predecessors, (110), 3 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 3 states have call predecessors, (86), 3 states have call successors, (86) Word has length 537 [2025-03-03 19:45:09,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:09,489 INFO L225 Difference]: With dead ends: 27010 [2025-03-03 19:45:09,489 INFO L226 Difference]: Without dead ends: 24882 [2025-03-03 19:45:09,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 19:45:09,504 INFO L435 NwaCegarLoop]: 756 mSDtfsCounter, 3741 mSDsluCounter, 2714 mSDsCounter, 0 mSdLazyCounter, 3904 mSolverCounterSat, 881 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3741 SdHoareTripleChecker+Valid, 3470 SdHoareTripleChecker+Invalid, 4785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 881 IncrementalHoareTripleChecker+Valid, 3904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:09,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3741 Valid, 3470 Invalid, 4785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [881 Valid, 3904 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-03 19:45:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24882 states. [2025-03-03 19:45:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24882 to 17193. [2025-03-03 19:45:10,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17193 states, 13360 states have (on average 1.5467065868263472) internal successors, (20664), 13444 states have internal predecessors, (20664), 3636 states have call successors, (3636), 196 states have call predecessors, (3636), 196 states have return successors, (3636), 3552 states have call predecessors, (3636), 3636 states have call successors, (3636) [2025-03-03 19:45:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17193 states to 17193 states and 27936 transitions. [2025-03-03 19:45:10,928 INFO L78 Accepts]: Start accepts. Automaton has 17193 states and 27936 transitions. Word has length 537 [2025-03-03 19:45:10,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:10,929 INFO L471 AbstractCegarLoop]: Abstraction has 17193 states and 27936 transitions. [2025-03-03 19:45:10,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 12 states have internal predecessors, (110), 3 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 3 states have call predecessors, (86), 3 states have call successors, (86) [2025-03-03 19:45:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 17193 states and 27936 transitions. [2025-03-03 19:45:10,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-03 19:45:10,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:10,943 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:45:10,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 19:45:10,943 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:10,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:10,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1516982923, now seen corresponding path program 1 times [2025-03-03 19:45:10,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:10,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521971336] [2025-03-03 19:45:10,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:10,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:10,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-03 19:45:11,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-03 19:45:11,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:11,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:11,630 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:45:11,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:11,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521971336] [2025-03-03 19:45:11,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521971336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:11,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:11,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 19:45:11,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971470601] [2025-03-03 19:45:11,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:11,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:45:11,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:11,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:45:11,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:45:11,633 INFO L87 Difference]: Start difference. First operand 17193 states and 27936 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-03 19:45:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:15,580 INFO L93 Difference]: Finished difference Result 51420 states and 83095 transitions. [2025-03-03 19:45:15,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 19:45:15,581 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) Word has length 537 [2025-03-03 19:45:15,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:15,719 INFO L225 Difference]: With dead ends: 51420 [2025-03-03 19:45:15,720 INFO L226 Difference]: Without dead ends: 42689 [2025-03-03 19:45:15,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:45:15,755 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 1434 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1434 SdHoareTripleChecker+Valid, 2623 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:15,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1434 Valid, 2623 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 19:45:15,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42689 states. [2025-03-03 19:45:17,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42689 to 34784. [2025-03-03 19:45:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34784 states, 27119 states have (on average 1.5493565396954165) internal successors, (42017), 27287 states have internal predecessors, (42017), 7272 states have call successors, (7272), 392 states have call predecessors, (7272), 392 states have return successors, (7272), 7104 states have call predecessors, (7272), 7272 states have call successors, (7272) [2025-03-03 19:45:18,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34784 states to 34784 states and 56561 transitions. [2025-03-03 19:45:18,133 INFO L78 Accepts]: Start accepts. Automaton has 34784 states and 56561 transitions. Word has length 537 [2025-03-03 19:45:18,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:18,134 INFO L471 AbstractCegarLoop]: Abstraction has 34784 states and 56561 transitions. [2025-03-03 19:45:18,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 2 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-03 19:45:18,134 INFO L276 IsEmpty]: Start isEmpty. Operand 34784 states and 56561 transitions. [2025-03-03 19:45:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-03 19:45:18,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:18,152 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:45:18,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 19:45:18,152 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:18,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:18,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2084882676, now seen corresponding path program 1 times [2025-03-03 19:45:18,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:18,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625631086] [2025-03-03 19:45:18,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:18,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:18,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-03 19:45:18,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-03 19:45:18,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:18,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:19,754 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:45:19,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:19,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625631086] [2025-03-03 19:45:19,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625631086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:19,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:19,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 19:45:19,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717855490] [2025-03-03 19:45:19,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:19,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:45:19,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:19,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:45:19,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:45:19,756 INFO L87 Difference]: Start difference. First operand 34784 states and 56561 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:45:23,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:23,272 INFO L93 Difference]: Finished difference Result 81857 states and 130209 transitions. [2025-03-03 19:45:23,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:45:23,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 537 [2025-03-03 19:45:23,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:23,419 INFO L225 Difference]: With dead ends: 81857 [2025-03-03 19:45:23,419 INFO L226 Difference]: Without dead ends: 47076 [2025-03-03 19:45:23,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:45:23,478 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 81 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1991 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:23,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1991 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:45:23,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47076 states. [2025-03-03 19:45:27,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47076 to 44768. [2025-03-03 19:45:27,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44768 states, 35183 states have (on average 1.505300855526817) internal successors, (52961), 35543 states have internal predecessors, (52961), 8808 states have call successors, (8808), 776 states have call predecessors, (8808), 776 states have return successors, (8808), 8448 states have call predecessors, (8808), 8808 states have call successors, (8808) [2025-03-03 19:45:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44768 states to 44768 states and 70577 transitions. [2025-03-03 19:45:27,412 INFO L78 Accepts]: Start accepts. Automaton has 44768 states and 70577 transitions. Word has length 537 [2025-03-03 19:45:27,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:27,413 INFO L471 AbstractCegarLoop]: Abstraction has 44768 states and 70577 transitions. [2025-03-03 19:45:27,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:45:27,413 INFO L276 IsEmpty]: Start isEmpty. Operand 44768 states and 70577 transitions. [2025-03-03 19:45:27,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-03 19:45:27,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:27,439 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:45:27,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 19:45:27,440 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:27,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:27,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1955799957, now seen corresponding path program 1 times [2025-03-03 19:45:27,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:27,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824962316] [2025-03-03 19:45:27,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:27,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:27,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-03 19:45:27,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-03 19:45:27,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:27,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:45:27,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:27,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824962316] [2025-03-03 19:45:27,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824962316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:27,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:27,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:45:27,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230375435] [2025-03-03 19:45:27,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:27,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:45:27,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:27,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:45:27,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:45:27,644 INFO L87 Difference]: Start difference. First operand 44768 states and 70577 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:45:30,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:30,353 INFO L93 Difference]: Finished difference Result 87613 states and 138079 transitions. [2025-03-03 19:45:30,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:45:30,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 537 [2025-03-03 19:45:30,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:30,518 INFO L225 Difference]: With dead ends: 87613 [2025-03-03 19:45:30,518 INFO L226 Difference]: Without dead ends: 42848 [2025-03-03 19:45:30,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:45:30,614 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 0 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:30,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 813 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:45:30,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42848 states. [2025-03-03 19:45:34,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42848 to 42848. [2025-03-03 19:45:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42848 states, 33263 states have (on average 1.4882902925172112) internal successors, (49505), 33623 states have internal predecessors, (49505), 8808 states have call successors, (8808), 776 states have call predecessors, (8808), 776 states have return successors, (8808), 8448 states have call predecessors, (8808), 8808 states have call successors, (8808) [2025-03-03 19:45:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42848 states to 42848 states and 67121 transitions. [2025-03-03 19:45:34,699 INFO L78 Accepts]: Start accepts. Automaton has 42848 states and 67121 transitions. Word has length 537 [2025-03-03 19:45:34,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:34,700 INFO L471 AbstractCegarLoop]: Abstraction has 42848 states and 67121 transitions. [2025-03-03 19:45:34,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:45:34,700 INFO L276 IsEmpty]: Start isEmpty. Operand 42848 states and 67121 transitions. [2025-03-03 19:45:34,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-03 19:45:34,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:34,724 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:45:34,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 19:45:34,724 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:34,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:34,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1704525995, now seen corresponding path program 1 times [2025-03-03 19:45:34,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:34,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13563599] [2025-03-03 19:45:34,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:34,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:34,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-03 19:45:34,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-03 19:45:34,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:34,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:34,861 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:45:34,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:34,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13563599] [2025-03-03 19:45:34,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13563599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:34,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:34,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:45:34,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434187298] [2025-03-03 19:45:34,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:34,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:45:34,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:34,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:45:34,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:45:34,863 INFO L87 Difference]: Start difference. First operand 42848 states and 67121 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:45:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:37,526 INFO L93 Difference]: Finished difference Result 79178 states and 124468 transitions. [2025-03-03 19:45:37,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:45:37,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 537 [2025-03-03 19:45:37,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:37,649 INFO L225 Difference]: With dead ends: 79178 [2025-03-03 19:45:37,649 INFO L226 Difference]: Without dead ends: 36333 [2025-03-03 19:45:37,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:45:37,730 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 0 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:37,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 804 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:45:37,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36333 states. [2025-03-03 19:45:40,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36333 to 36333. [2025-03-03 19:45:40,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36333 states, 28276 states have (on average 1.5065072853303154) internal successors, (42598), 28445 states have internal predecessors, (42598), 7280 states have call successors, (7280), 776 states have call predecessors, (7280), 776 states have return successors, (7280), 7111 states have call predecessors, (7280), 7280 states have call successors, (7280) [2025-03-03 19:45:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36333 states to 36333 states and 57158 transitions. [2025-03-03 19:45:40,192 INFO L78 Accepts]: Start accepts. Automaton has 36333 states and 57158 transitions. Word has length 537 [2025-03-03 19:45:40,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:40,192 INFO L471 AbstractCegarLoop]: Abstraction has 36333 states and 57158 transitions. [2025-03-03 19:45:40,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-03-03 19:45:40,192 INFO L276 IsEmpty]: Start isEmpty. Operand 36333 states and 57158 transitions. [2025-03-03 19:45:40,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-03-03 19:45:40,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:40,206 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:45:40,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 19:45:40,206 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:40,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:40,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1494222117, now seen corresponding path program 1 times [2025-03-03 19:45:40,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:40,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690425909] [2025-03-03 19:45:40,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:40,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:40,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-03 19:45:40,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-03 19:45:40,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:40,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:45:40,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2084082485] [2025-03-03 19:45:40,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:40,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:45:40,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:45:40,374 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:45:40,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 19:45:40,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-03 19:45:40,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-03 19:45:40,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:40,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:40,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 1197 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 19:45:40,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:45:41,930 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 1233 proven. 9 refuted. 0 times theorem prover too weak. 13378 trivial. 0 not checked. [2025-03-03 19:45:41,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:45:42,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:42,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690425909] [2025-03-03 19:45:42,097 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 19:45:42,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084082485] [2025-03-03 19:45:42,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084082485] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:45:42,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:45:42,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-03 19:45:42,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667140438] [2025-03-03 19:45:42,098 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 19:45:42,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:45:42,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:42,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:45:42,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:45:42,100 INFO L87 Difference]: Start difference. First operand 36333 states and 57158 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 states have internal predecessors, (118), 2 states have call successors, (86), 2 states have call predecessors, (86), 3 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-03 19:45:47,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:45:47,531 INFO L93 Difference]: Finished difference Result 109831 states and 172266 transitions. [2025-03-03 19:45:47,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:45:47,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 states have internal predecessors, (118), 2 states have call successors, (86), 2 states have call predecessors, (86), 3 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) Word has length 539 [2025-03-03 19:45:47,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:45:47,793 INFO L225 Difference]: With dead ends: 109831 [2025-03-03 19:45:47,793 INFO L226 Difference]: Without dead ends: 73514 [2025-03-03 19:45:47,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 604 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:45:47,870 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 432 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:45:47,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1175 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:45:47,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73514 states. [2025-03-03 19:45:53,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73514 to 71830. [2025-03-03 19:45:54,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71830 states, 55701 states have (on average 1.495574585734547) internal successors, (83305), 56038 states have internal predecessors, (83305), 14552 states have call successors, (14552), 1576 states have call predecessors, (14552), 1576 states have return successors, (14552), 14215 states have call predecessors, (14552), 14552 states have call successors, (14552) [2025-03-03 19:45:54,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71830 states to 71830 states and 112409 transitions. [2025-03-03 19:45:54,280 INFO L78 Accepts]: Start accepts. Automaton has 71830 states and 112409 transitions. Word has length 539 [2025-03-03 19:45:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:45:54,280 INFO L471 AbstractCegarLoop]: Abstraction has 71830 states and 112409 transitions. [2025-03-03 19:45:54,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 5 states have internal predecessors, (118), 2 states have call successors, (86), 2 states have call predecessors, (86), 3 states have return successors, (86), 2 states have call predecessors, (86), 2 states have call successors, (86) [2025-03-03 19:45:54,281 INFO L276 IsEmpty]: Start isEmpty. Operand 71830 states and 112409 transitions. [2025-03-03 19:45:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-03-03 19:45:54,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:45:54,305 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:45:54,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 19:45:54,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 19:45:54,505 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:45:54,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:45:54,506 INFO L85 PathProgramCache]: Analyzing trace with hash -389771574, now seen corresponding path program 1 times [2025-03-03 19:45:54,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:45:54,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540570808] [2025-03-03 19:45:54,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:45:54,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:45:54,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-03-03 19:45:54,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-03-03 19:45:54,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:45:54,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:45:54,697 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-03-03 19:45:54,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:45:54,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540570808] [2025-03-03 19:45:54,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540570808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:45:54,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:45:54,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:45:54,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186337730] [2025-03-03 19:45:54,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:45:54,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:45:54,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:45:54,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:45:54,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:45:54,699 INFO L87 Difference]: Start difference. First operand 71830 states and 112409 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86)