./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_codestructure_normal_file-34.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 1210d8db9779caa2b34faedb9da4e6c42e2b8376c95e81a461341238221703f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:00:23,802 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:00:23,853 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:00:23,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:00:23,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:00:23,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:00:23,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:00:23,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:00:23,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:00:23,881 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:00:23,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:00:23,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:00:23,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:00:23,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:00:23,883 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:00:23,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:00:23,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:00:23,883 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:00:23,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:00:23,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:00:23,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:00:23,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:00:23,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:00:23,884 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:00:23,884 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:00:23,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:00:23,884 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:00:23,884 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:00:23,884 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:00:23,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:00:23,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:00:23,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:00:23,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:00:23,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:00:23,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:00:23,885 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:00:23,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:00:23,885 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:00:23,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:00:23,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:00:23,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:00:23,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:00:23,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:00:23,886 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 -> 1210d8db9779caa2b34faedb9da4e6c42e2b8376c95e81a461341238221703f5 [2025-03-08 10:00:24,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:00:24,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:00:24,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:00:24,100 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:00:24,101 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:00:24,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-34.i [2025-03-08 10:00:25,217 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d87a0700/8ffb74288a61488e987d9fde02cbd57e/FLAGe31dbef9f [2025-03-08 10:00:25,436 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:00:25,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-34.i [2025-03-08 10:00:25,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d87a0700/8ffb74288a61488e987d9fde02cbd57e/FLAGe31dbef9f [2025-03-08 10:00:25,458 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d87a0700/8ffb74288a61488e987d9fde02cbd57e [2025-03-08 10:00:25,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:00:25,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:00:25,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:00:25,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:00:25,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:00:25,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:00:25" (1/1) ... [2025-03-08 10:00:25,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d31ac5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:25, skipping insertion in model container [2025-03-08 10:00:25,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:00:25" (1/1) ... [2025-03-08 10:00:25,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:00:25,563 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_codestructure_normal_file-34.i[913,926] [2025-03-08 10:00:25,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:00:25,628 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:00:25,635 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_codestructure_normal_file-34.i[913,926] [2025-03-08 10:00:25,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:00:25,685 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:00:25,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:25 WrapperNode [2025-03-08 10:00:25,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:00:25,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:00:25,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:00:25,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:00:25,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:25" (1/1) ... [2025-03-08 10:00:25,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:25" (1/1) ... [2025-03-08 10:00:25,740 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2025-03-08 10:00:25,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:00:25,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:00:25,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:00:25,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:00:25,750 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:25" (1/1) ... [2025-03-08 10:00:25,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:25" (1/1) ... [2025-03-08 10:00:25,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:25" (1/1) ... [2025-03-08 10:00:25,770 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-08 10:00:25,770 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:25" (1/1) ... [2025-03-08 10:00:25,770 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:25" (1/1) ... [2025-03-08 10:00:25,778 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:25" (1/1) ... [2025-03-08 10:00:25,782 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:25" (1/1) ... [2025-03-08 10:00:25,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:25" (1/1) ... [2025-03-08 10:00:25,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:25" (1/1) ... [2025-03-08 10:00:25,789 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:00:25,791 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:00:25,792 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:00:25,792 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:00:25,793 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:25" (1/1) ... [2025-03-08 10:00:25,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:00:25,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:00:25,816 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-08 10:00:25,819 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-08 10:00:25,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:00:25,835 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:00:25,836 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:00:25,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:00:25,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:00:25,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:00:25,882 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:00:25,883 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:00:26,160 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L132: havoc property_#t~bitwise20#1;havoc property_#t~ite22#1;havoc property_#t~bitwise21#1;havoc property_#t~short23#1; [2025-03-08 10:00:26,186 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-08 10:00:26,186 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:00:26,202 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:00:26,203 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:00:26,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:00:26 BoogieIcfgContainer [2025-03-08 10:00:26,203 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:00:26,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:00:26,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:00:26,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:00:26,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:00:25" (1/3) ... [2025-03-08 10:00:26,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd257b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:00:26, skipping insertion in model container [2025-03-08 10:00:26,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:00:25" (2/3) ... [2025-03-08 10:00:26,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd257b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:00:26, skipping insertion in model container [2025-03-08 10:00:26,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:00:26" (3/3) ... [2025-03-08 10:00:26,209 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-34.i [2025-03-08 10:00:26,219 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:00:26,221 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-34.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:00:26,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:00:26,273 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;@4340d467, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:00:26,273 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:00:26,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:00:26,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 10:00:26,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:00:26,284 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:00:26,284 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:00:26,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:00:26,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1719519187, now seen corresponding path program 1 times [2025-03-08 10:00:26,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:00:26,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353787288] [2025-03-08 10:00:26,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:00:26,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:00:26,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 10:00:26,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 10:00:26,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:00:26,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:00:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-08 10:00:26,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:00:26,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353787288] [2025-03-08 10:00:26,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353787288] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:00:26,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537912432] [2025-03-08 10:00:26,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:00:26,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:00:26,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:00:26,560 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-08 10:00:26,562 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-08 10:00:26,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 10:00:26,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 10:00:26,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:00:26,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:00:26,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:00:26,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:00:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-03-08 10:00:26,702 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:00:26,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537912432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:00:26,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:00:26,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:00:26,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995284093] [2025-03-08 10:00:26,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:00:26,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:00:26,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:00:26,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:00:26,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:00:26,725 INFO L87 Difference]: Start difference. First operand has 89 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 10:00:26,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:00:26,757 INFO L93 Difference]: Finished difference Result 172 states and 300 transitions. [2025-03-08 10:00:26,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:00:26,759 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 169 [2025-03-08 10:00:26,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:00:26,764 INFO L225 Difference]: With dead ends: 172 [2025-03-08 10:00:26,764 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 10:00:26,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 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-08 10:00:26,767 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:00:26,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:00:26,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 10:00:26,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-08 10:00:26,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:00:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2025-03-08 10:00:26,794 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 169 [2025-03-08 10:00:26,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:00:26,794 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2025-03-08 10:00:26,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 10:00:26,795 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2025-03-08 10:00:26,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 10:00:26,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:00:26,797 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:00:26,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 10:00:26,999 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-08 10:00:26,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:00:27,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:00:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1173146862, now seen corresponding path program 1 times [2025-03-08 10:00:27,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:00:27,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343292466] [2025-03-08 10:00:27,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:00:27,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:00:27,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 10:00:27,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 10:00:27,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:00:27,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:00:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:00:27,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:00:27,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343292466] [2025-03-08 10:00:27,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343292466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:00:27,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:00:27,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:00:27,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593409884] [2025-03-08 10:00:27,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:00:27,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:00:27,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:00:27,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:00:27,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:00:27,167 INFO L87 Difference]: Start difference. First operand 86 states and 134 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:00:27,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:00:27,215 INFO L93 Difference]: Finished difference Result 206 states and 322 transitions. [2025-03-08 10:00:27,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:00:27,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 169 [2025-03-08 10:00:27,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:00:27,218 INFO L225 Difference]: With dead ends: 206 [2025-03-08 10:00:27,218 INFO L226 Difference]: Without dead ends: 123 [2025-03-08 10:00:27,219 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-08 10:00:27,219 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 53 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:00:27,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 252 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:00:27,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-08 10:00:27,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 90. [2025-03-08 10:00:27,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 61 states have internal predecessors, (87), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:00:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 141 transitions. [2025-03-08 10:00:27,231 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 141 transitions. Word has length 169 [2025-03-08 10:00:27,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:00:27,232 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 141 transitions. [2025-03-08 10:00:27,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:00:27,232 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 141 transitions. [2025-03-08 10:00:27,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 10:00:27,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:00:27,237 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:00:27,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:00:27,238 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:00:27,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:00:27,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1466549869, now seen corresponding path program 1 times [2025-03-08 10:00:27,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:00:27,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618006511] [2025-03-08 10:00:27,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:00:27,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:00:27,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 10:00:27,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 10:00:27,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:00:27,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:00:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:00:28,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:00:28,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618006511] [2025-03-08 10:00:28,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618006511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:00:28,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:00:28,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 10:00:28,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374759350] [2025-03-08 10:00:28,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:00:28,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:00:28,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:00:28,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:00:28,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:00:28,354 INFO L87 Difference]: Start difference. First operand 90 states and 141 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:00:28,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:00:28,550 INFO L93 Difference]: Finished difference Result 245 states and 380 transitions. [2025-03-08 10:00:28,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 10:00:28,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 169 [2025-03-08 10:00:28,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:00:28,552 INFO L225 Difference]: With dead ends: 245 [2025-03-08 10:00:28,552 INFO L226 Difference]: Without dead ends: 158 [2025-03-08 10:00:28,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-08 10:00:28,553 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 136 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:00:28,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 489 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:00:28,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-08 10:00:28,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 108. [2025-03-08 10:00:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 79 states have internal predecessors, (116), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:00:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 170 transitions. [2025-03-08 10:00:28,567 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 170 transitions. Word has length 169 [2025-03-08 10:00:28,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:00:28,567 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 170 transitions. [2025-03-08 10:00:28,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:00:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 170 transitions. [2025-03-08 10:00:28,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:00:28,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:00:28,571 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:00:28,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:00:28,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:00:28,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:00:28,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1174272297, now seen corresponding path program 1 times [2025-03-08 10:00:28,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:00:28,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449622044] [2025-03-08 10:00:28,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:00:28,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:00:28,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:00:28,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:00:28,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:00:28,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:00:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:00:38,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:00:38,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449622044] [2025-03-08 10:00:38,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449622044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:00:38,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:00:38,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:00:38,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288596693] [2025-03-08 10:00:38,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:00:38,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:00:38,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:00:38,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:00:38,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:00:38,075 INFO L87 Difference]: Start difference. First operand 108 states and 170 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:00:38,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:00:38,591 INFO L93 Difference]: Finished difference Result 352 states and 547 transitions. [2025-03-08 10:00:38,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:00:38,592 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-08 10:00:38,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:00:38,594 INFO L225 Difference]: With dead ends: 352 [2025-03-08 10:00:38,596 INFO L226 Difference]: Without dead ends: 247 [2025-03-08 10:00:38,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:00:38,597 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 281 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:00:38,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 838 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:00:38,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-08 10:00:38,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 111. [2025-03-08 10:00:38,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 82 states have internal predecessors, (120), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:00:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 174 transitions. [2025-03-08 10:00:38,609 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 174 transitions. Word has length 170 [2025-03-08 10:00:38,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:00:38,610 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 174 transitions. [2025-03-08 10:00:38,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:00:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 174 transitions. [2025-03-08 10:00:38,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:00:38,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:00:38,611 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:00:38,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:00:38,612 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:00:38,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:00:38,612 INFO L85 PathProgramCache]: Analyzing trace with hash 668713672, now seen corresponding path program 1 times [2025-03-08 10:00:38,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:00:38,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608542741] [2025-03-08 10:00:38,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:00:38,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:00:38,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:00:38,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:00:38,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:00:38,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:00:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:00:46,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:00:46,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608542741] [2025-03-08 10:00:46,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608542741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:00:46,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:00:46,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:00:46,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368063126] [2025-03-08 10:00:46,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:00:46,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:00:46,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:00:46,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:00:46,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:00:46,253 INFO L87 Difference]: Start difference. First operand 111 states and 174 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:00:46,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:00:46,631 INFO L93 Difference]: Finished difference Result 355 states and 546 transitions. [2025-03-08 10:00:46,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:00:46,633 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-08 10:00:46,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:00:46,634 INFO L225 Difference]: With dead ends: 355 [2025-03-08 10:00:46,635 INFO L226 Difference]: Without dead ends: 247 [2025-03-08 10:00:46,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:00:46,636 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 322 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:00:46,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 863 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:00:46,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-08 10:00:46,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 134. [2025-03-08 10:00:46,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 105 states have (on average 1.4666666666666666) internal successors, (154), 105 states have internal predecessors, (154), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:00:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 208 transitions. [2025-03-08 10:00:46,649 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 208 transitions. Word has length 170 [2025-03-08 10:00:46,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:00:46,650 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 208 transitions. [2025-03-08 10:00:46,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:00:46,650 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 208 transitions. [2025-03-08 10:00:46,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:00:46,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:00:46,651 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:00:46,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 10:00:46,651 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:00:46,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:00:46,652 INFO L85 PathProgramCache]: Analyzing trace with hash 663738120, now seen corresponding path program 1 times [2025-03-08 10:00:46,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:00:46,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300435632] [2025-03-08 10:00:46,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:00:46,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:00:46,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:00:46,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:00:46,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:00:46,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:00:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:00:54,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:00:54,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300435632] [2025-03-08 10:00:54,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300435632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:00:54,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:00:54,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 10:00:54,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652420818] [2025-03-08 10:00:54,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:00:54,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:00:54,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:00:54,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:00:54,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:00:54,298 INFO L87 Difference]: Start difference. First operand 134 states and 208 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:00:54,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:00:54,669 INFO L93 Difference]: Finished difference Result 383 states and 590 transitions. [2025-03-08 10:00:54,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 10:00:54,670 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-08 10:00:54,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:00:54,671 INFO L225 Difference]: With dead ends: 383 [2025-03-08 10:00:54,671 INFO L226 Difference]: Without dead ends: 252 [2025-03-08 10:00:54,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:00:54,672 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 159 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:00:54,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 932 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:00:54,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-08 10:00:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 135. [2025-03-08 10:00:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 106 states have internal predecessors, (155), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:00:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 209 transitions. [2025-03-08 10:00:54,678 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 209 transitions. Word has length 170 [2025-03-08 10:00:54,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:00:54,678 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 209 transitions. [2025-03-08 10:00:54,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:00:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 209 transitions. [2025-03-08 10:00:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:00:54,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:00:54,680 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:00:54,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 10:00:54,680 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:00:54,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:00:54,680 INFO L85 PathProgramCache]: Analyzing trace with hash 158179495, now seen corresponding path program 1 times [2025-03-08 10:00:54,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:00:54,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027847702] [2025-03-08 10:00:54,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:00:54,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:00:54,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:00:54,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:00:54,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:00:54,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:01:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:01:02,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:01:02,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027847702] [2025-03-08 10:01:02,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027847702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:01:02,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:01:02,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 10:01:02,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439882662] [2025-03-08 10:01:02,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:01:02,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:01:02,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:01:02,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:01:02,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:01:02,117 INFO L87 Difference]: Start difference. First operand 135 states and 209 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:02,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:01:02,423 INFO L93 Difference]: Finished difference Result 384 states and 589 transitions. [2025-03-08 10:01:02,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 10:01:02,426 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-08 10:01:02,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:01:02,427 INFO L225 Difference]: With dead ends: 384 [2025-03-08 10:01:02,427 INFO L226 Difference]: Without dead ends: 252 [2025-03-08 10:01:02,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:01:02,428 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 147 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 10:01:02,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1006 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 10:01:02,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-08 10:01:02,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 134. [2025-03-08 10:01:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 105 states have (on average 1.457142857142857) internal successors, (153), 105 states have internal predecessors, (153), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:01:02,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 207 transitions. [2025-03-08 10:01:02,438 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 207 transitions. Word has length 170 [2025-03-08 10:01:02,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:01:02,438 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 207 transitions. [2025-03-08 10:01:02,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 207 transitions. [2025-03-08 10:01:02,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:01:02,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:01:02,443 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:01:02,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:01:02,444 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:01:02,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:01:02,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1267408086, now seen corresponding path program 1 times [2025-03-08 10:01:02,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:01:02,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673157615] [2025-03-08 10:01:02,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:01:02,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:01:02,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:01:02,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:01:02,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:01:02,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:01:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:01:04,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:01:04,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673157615] [2025-03-08 10:01:04,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673157615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:01:04,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:01:04,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 10:01:04,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293102397] [2025-03-08 10:01:04,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:01:04,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 10:01:04,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:01:04,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 10:01:04,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:01:04,122 INFO L87 Difference]: Start difference. First operand 134 states and 207 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:04,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:01:04,708 INFO L93 Difference]: Finished difference Result 419 states and 636 transitions. [2025-03-08 10:01:04,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:01:04,709 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-08 10:01:04,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:01:04,711 INFO L225 Difference]: With dead ends: 419 [2025-03-08 10:01:04,711 INFO L226 Difference]: Without dead ends: 288 [2025-03-08 10:01:04,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:01:04,711 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 376 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:01:04,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 612 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:01:04,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-08 10:01:04,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 158. [2025-03-08 10:01:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 129 states have (on average 1.4883720930232558) internal successors, (192), 129 states have internal predecessors, (192), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:01:04,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 246 transitions. [2025-03-08 10:01:04,718 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 246 transitions. Word has length 170 [2025-03-08 10:01:04,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:01:04,718 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 246 transitions. [2025-03-08 10:01:04,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:04,718 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 246 transitions. [2025-03-08 10:01:04,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:01:04,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:01:04,719 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:01:04,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:01:04,720 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:01:04,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:01:04,720 INFO L85 PathProgramCache]: Analyzing trace with hash 475402249, now seen corresponding path program 1 times [2025-03-08 10:01:04,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:01:04,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702990154] [2025-03-08 10:01:04,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:01:04,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:01:04,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:01:04,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:01:04,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:01:04,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:01:13,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:01:13,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:01:13,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702990154] [2025-03-08 10:01:13,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702990154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:01:13,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:01:13,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 10:01:13,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911496000] [2025-03-08 10:01:13,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:01:13,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 10:01:13,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:01:13,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 10:01:13,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:01:13,057 INFO L87 Difference]: Start difference. First operand 158 states and 246 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:01:13,824 INFO L93 Difference]: Finished difference Result 429 states and 658 transitions. [2025-03-08 10:01:13,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:01:13,825 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-08 10:01:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:01:13,827 INFO L225 Difference]: With dead ends: 429 [2025-03-08 10:01:13,827 INFO L226 Difference]: Without dead ends: 274 [2025-03-08 10:01:13,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:01:13,827 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 254 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 10:01:13,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 755 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 10:01:13,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-08 10:01:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 155. [2025-03-08 10:01:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 126 states have (on average 1.4761904761904763) internal successors, (186), 126 states have internal predecessors, (186), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:01:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 240 transitions. [2025-03-08 10:01:13,832 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 240 transitions. Word has length 170 [2025-03-08 10:01:13,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:01:13,833 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 240 transitions. [2025-03-08 10:01:13,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 240 transitions. [2025-03-08 10:01:13,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:01:13,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:01:13,835 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:01:13,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 10:01:13,835 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:01:13,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:01:13,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1772966711, now seen corresponding path program 1 times [2025-03-08 10:01:13,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:01:13,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310511623] [2025-03-08 10:01:13,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:01:13,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:01:13,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:01:13,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:01:13,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:01:13,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:01:14,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:01:14,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:01:14,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310511623] [2025-03-08 10:01:14,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310511623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:01:14,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:01:14,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 10:01:14,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828215790] [2025-03-08 10:01:14,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:01:14,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 10:01:14,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:01:14,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 10:01:14,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:01:14,657 INFO L87 Difference]: Start difference. First operand 155 states and 240 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:15,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:01:15,232 INFO L93 Difference]: Finished difference Result 438 states and 662 transitions. [2025-03-08 10:01:15,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:01:15,232 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-08 10:01:15,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:01:15,234 INFO L225 Difference]: With dead ends: 438 [2025-03-08 10:01:15,234 INFO L226 Difference]: Without dead ends: 286 [2025-03-08 10:01:15,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:01:15,234 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 303 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:01:15,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 705 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:01:15,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-08 10:01:15,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 167. [2025-03-08 10:01:15,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 138 states have (on average 1.4927536231884058) internal successors, (206), 138 states have internal predecessors, (206), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:01:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 260 transitions. [2025-03-08 10:01:15,240 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 260 transitions. Word has length 170 [2025-03-08 10:01:15,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:01:15,240 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 260 transitions. [2025-03-08 10:01:15,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:15,240 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 260 transitions. [2025-03-08 10:01:15,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:01:15,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:01:15,241 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:01:15,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 10:01:15,242 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:01:15,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:01:15,242 INFO L85 PathProgramCache]: Analyzing trace with hash -30156376, now seen corresponding path program 1 times [2025-03-08 10:01:15,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:01:15,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416826657] [2025-03-08 10:01:15,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:01:15,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:01:15,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:01:15,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:01:15,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:01:15,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:01:15,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:01:15,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:01:15,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416826657] [2025-03-08 10:01:15,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416826657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:01:15,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:01:15,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:01:15,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142437680] [2025-03-08 10:01:15,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:01:15,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:01:15,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:01:15,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:01:15,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:01:15,991 INFO L87 Difference]: Start difference. First operand 167 states and 260 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:16,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:01:16,536 INFO L93 Difference]: Finished difference Result 431 states and 662 transitions. [2025-03-08 10:01:16,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:01:16,537 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-08 10:01:16,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:01:16,538 INFO L225 Difference]: With dead ends: 431 [2025-03-08 10:01:16,538 INFO L226 Difference]: Without dead ends: 267 [2025-03-08 10:01:16,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:01:16,539 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 234 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 10:01:16,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 560 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 10:01:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-03-08 10:01:16,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 167. [2025-03-08 10:01:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 138 states have (on average 1.4927536231884058) internal successors, (206), 138 states have internal predecessors, (206), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-08 10:01:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 260 transitions. [2025-03-08 10:01:16,547 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 260 transitions. Word has length 170 [2025-03-08 10:01:16,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:01:16,548 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 260 transitions. [2025-03-08 10:01:16,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:16,548 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 260 transitions. [2025-03-08 10:01:16,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-08 10:01:16,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:01:16,549 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:01:16,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 10:01:16,550 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:01:16,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:01:16,550 INFO L85 PathProgramCache]: Analyzing trace with hash 240143723, now seen corresponding path program 1 times [2025-03-08 10:01:16,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:01:16,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85181987] [2025-03-08 10:01:16,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:01:16,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:01:16,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 10:01:16,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 10:01:16,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:01:16,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:01:16,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:01:16,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:01:16,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85181987] [2025-03-08 10:01:16,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85181987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:01:16,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:01:16,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:01:16,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353617917] [2025-03-08 10:01:16,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:01:16,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:01:16,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:01:16,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:01:16,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:01:16,697 INFO L87 Difference]: Start difference. First operand 167 states and 260 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:16,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:01:16,831 INFO L93 Difference]: Finished difference Result 377 states and 584 transitions. [2025-03-08 10:01:16,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:01:16,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 170 [2025-03-08 10:01:16,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:01:16,833 INFO L225 Difference]: With dead ends: 377 [2025-03-08 10:01:16,833 INFO L226 Difference]: Without dead ends: 213 [2025-03-08 10:01:16,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:01:16,833 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 66 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:01:16,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 348 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:01:16,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-08 10:01:16,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2025-03-08 10:01:16,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 176 states have (on average 1.4886363636363635) internal successors, (262), 177 states have internal predecessors, (262), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 10:01:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 324 transitions. [2025-03-08 10:01:16,840 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 324 transitions. Word has length 170 [2025-03-08 10:01:16,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:01:16,841 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 324 transitions. [2025-03-08 10:01:16,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:16,841 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 324 transitions. [2025-03-08 10:01:16,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 10:01:16,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:01:16,842 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:01:16,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 10:01:16,842 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:01:16,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:01:16,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1218455182, now seen corresponding path program 1 times [2025-03-08 10:01:16,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:01:16,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400425678] [2025-03-08 10:01:16,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:01:16,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:01:16,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 10:01:16,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 10:01:16,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:01:16,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:01:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:01:18,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:01:18,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400425678] [2025-03-08 10:01:18,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400425678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:01:18,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:01:18,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 10:01:18,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033721998] [2025-03-08 10:01:18,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:01:18,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 10:01:18,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:01:18,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 10:01:18,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:01:18,500 INFO L87 Difference]: Start difference. First operand 210 states and 324 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:19,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:01:19,279 INFO L93 Difference]: Finished difference Result 604 states and 918 transitions. [2025-03-08 10:01:19,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 10:01:19,280 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-08 10:01:19,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:01:19,282 INFO L225 Difference]: With dead ends: 604 [2025-03-08 10:01:19,282 INFO L226 Difference]: Without dead ends: 397 [2025-03-08 10:01:19,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-03-08 10:01:19,283 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 372 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 10:01:19,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 762 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 10:01:19,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-08 10:01:19,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 211. [2025-03-08 10:01:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 177 states have (on average 1.4858757062146892) internal successors, (263), 178 states have internal predecessors, (263), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 10:01:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 325 transitions. [2025-03-08 10:01:19,290 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 325 transitions. Word has length 171 [2025-03-08 10:01:19,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:01:19,290 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 325 transitions. [2025-03-08 10:01:19,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:19,290 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 325 transitions. [2025-03-08 10:01:19,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 10:01:19,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:01:19,291 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:01:19,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 10:01:19,292 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:01:19,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:01:19,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1724013807, now seen corresponding path program 1 times [2025-03-08 10:01:19,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:01:19,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696621695] [2025-03-08 10:01:19,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:01:19,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:01:19,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 10:01:19,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 10:01:19,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:01:19,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:01:27,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:01:27,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:01:27,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696621695] [2025-03-08 10:01:27,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696621695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:01:27,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:01:27,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-08 10:01:27,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459174202] [2025-03-08 10:01:27,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:01:27,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 10:01:27,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:01:27,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 10:01:27,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:01:27,758 INFO L87 Difference]: Start difference. First operand 211 states and 325 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:28,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:01:28,714 INFO L93 Difference]: Finished difference Result 604 states and 912 transitions. [2025-03-08 10:01:28,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 10:01:28,714 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-08 10:01:28,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:01:28,717 INFO L225 Difference]: With dead ends: 604 [2025-03-08 10:01:28,717 INFO L226 Difference]: Without dead ends: 396 [2025-03-08 10:01:28,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-08 10:01:28,718 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 281 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 10:01:28,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 996 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 10:01:28,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-08 10:01:28,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 194. [2025-03-08 10:01:28,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 160 states have (on average 1.46875) internal successors, (235), 161 states have internal predecessors, (235), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 10:01:28,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 297 transitions. [2025-03-08 10:01:28,726 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 297 transitions. Word has length 171 [2025-03-08 10:01:28,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:01:28,727 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 297 transitions. [2025-03-08 10:01:28,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:28,727 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 297 transitions. [2025-03-08 10:01:28,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-08 10:01:28,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:01:28,728 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:01:28,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 10:01:28,728 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:01:28,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:01:28,728 INFO L85 PathProgramCache]: Analyzing trace with hash 2091262573, now seen corresponding path program 1 times [2025-03-08 10:01:28,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:01:28,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344226413] [2025-03-08 10:01:28,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:01:28,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:01:28,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-08 10:01:28,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-08 10:01:28,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:01:28,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:01:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:01:28,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:01:28,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344226413] [2025-03-08 10:01:28,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344226413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:01:28,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:01:28,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:01:28,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092850996] [2025-03-08 10:01:28,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:01:28,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:01:28,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:01:28,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:01:28,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:01:28,816 INFO L87 Difference]: Start difference. First operand 194 states and 297 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:28,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:01:28,930 INFO L93 Difference]: Finished difference Result 389 states and 595 transitions. [2025-03-08 10:01:28,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:01:28,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2025-03-08 10:01:28,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:01:28,931 INFO L225 Difference]: With dead ends: 389 [2025-03-08 10:01:28,931 INFO L226 Difference]: Without dead ends: 198 [2025-03-08 10:01:28,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-08 10:01:28,932 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 64 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:01:28,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 354 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:01:28,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-08 10:01:28,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 194. [2025-03-08 10:01:28,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 160 states have (on average 1.46875) internal successors, (235), 161 states have internal predecessors, (235), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 10:01:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 297 transitions. [2025-03-08 10:01:28,938 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 297 transitions. Word has length 171 [2025-03-08 10:01:28,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:01:28,938 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 297 transitions. [2025-03-08 10:01:28,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:28,938 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 297 transitions. [2025-03-08 10:01:28,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-08 10:01:28,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:01:28,939 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:01:28,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 10:01:28,939 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:01:28,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:01:28,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1098405842, now seen corresponding path program 1 times [2025-03-08 10:01:28,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:01:28,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001533786] [2025-03-08 10:01:28,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:01:28,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:01:28,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 10:01:28,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 10:01:28,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:01:28,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:01:29,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:01:29,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:01:29,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001533786] [2025-03-08 10:01:29,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001533786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:01:29,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:01:29,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 10:01:29,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38794553] [2025-03-08 10:01:29,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:01:29,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 10:01:29,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:01:29,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 10:01:29,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 10:01:29,869 INFO L87 Difference]: Start difference. First operand 194 states and 297 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:30,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:01:30,406 INFO L93 Difference]: Finished difference Result 538 states and 813 transitions. [2025-03-08 10:01:30,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:01:30,407 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2025-03-08 10:01:30,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:01:30,408 INFO L225 Difference]: With dead ends: 538 [2025-03-08 10:01:30,408 INFO L226 Difference]: Without dead ends: 347 [2025-03-08 10:01:30,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:01:30,409 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 270 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:01:30,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 704 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:01:30,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-08 10:01:30,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 212. [2025-03-08 10:01:30,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 178 states have (on average 1.4775280898876404) internal successors, (263), 179 states have internal predecessors, (263), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 10:01:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 325 transitions. [2025-03-08 10:01:30,418 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 325 transitions. Word has length 172 [2025-03-08 10:01:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:01:30,418 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 325 transitions. [2025-03-08 10:01:30,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 325 transitions. [2025-03-08 10:01:30,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-08 10:01:30,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:01:30,419 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:01:30,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 10:01:30,419 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:01:30,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:01:30,420 INFO L85 PathProgramCache]: Analyzing trace with hash 587871665, now seen corresponding path program 1 times [2025-03-08 10:01:30,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:01:30,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217980237] [2025-03-08 10:01:30,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:01:30,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:01:30,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 10:01:30,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 10:01:30,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:01:30,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:01:38,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-03-08 10:01:38,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:01:38,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217980237] [2025-03-08 10:01:38,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217980237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:01:38,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:01:38,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 10:01:38,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180844178] [2025-03-08 10:01:38,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:01:38,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 10:01:38,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:01:38,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 10:01:38,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:01:38,133 INFO L87 Difference]: Start difference. First operand 212 states and 325 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:38,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:01:38,647 INFO L93 Difference]: Finished difference Result 556 states and 840 transitions. [2025-03-08 10:01:38,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:01:38,648 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2025-03-08 10:01:38,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:01:38,649 INFO L225 Difference]: With dead ends: 556 [2025-03-08 10:01:38,649 INFO L226 Difference]: Without dead ends: 347 [2025-03-08 10:01:38,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 10:01:38,650 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 222 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 10:01:38,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 1017 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 10:01:38,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-08 10:01:38,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 235. [2025-03-08 10:01:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 201 states have (on average 1.4776119402985075) internal successors, (297), 202 states have internal predecessors, (297), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-08 10:01:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 359 transitions. [2025-03-08 10:01:38,658 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 359 transitions. Word has length 172 [2025-03-08 10:01:38,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:01:38,658 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 359 transitions. [2025-03-08 10:01:38,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-03-08 10:01:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 359 transitions. [2025-03-08 10:01:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-03-08 10:01:38,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:01:38,660 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 10:01:38,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 10:01:38,660 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:01:38,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:01:38,661 INFO L85 PathProgramCache]: Analyzing trace with hash -2001142404, now seen corresponding path program 1 times [2025-03-08 10:01:38,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:01:38,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400140816] [2025-03-08 10:01:38,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:01:38,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:01:38,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 10:01:38,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 10:01:38,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:01:38,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat