./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-81.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 743733c75edc203d6a3698a34f61f0abb7399fbb75a2d96375820580e8166eb4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:41:10,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:41:10,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:41:10,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:41:10,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:41:10,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:41:10,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:41:10,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:41:10,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:41:10,286 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:41:10,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:41:10,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:41:10,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:41:10,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:41:10,287 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:41:10,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:41:10,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:41:10,287 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:41:10,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:41:10,287 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:41:10,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:41:10,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:41:10,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:41:10,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:41:10,288 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:41:10,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:41:10,288 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:41:10,288 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:41:10,288 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:41:10,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:41:10,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:41:10,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:41:10,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:41:10,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:41:10,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:41:10,289 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:41:10,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:41:10,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:41:10,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:41:10,289 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:41:10,289 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:41:10,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:41:10,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:41:10,290 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 743733c75edc203d6a3698a34f61f0abb7399fbb75a2d96375820580e8166eb4 [2025-02-06 01:41:10,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:41:10,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:41:10,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:41:10,509 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:41:10,511 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:41:10,512 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-81.i [2025-02-06 01:41:11,680 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21f60e126/24036a6bf09b44cb9bff979db9eb5ab0/FLAGc10dc1b1f [2025-02-06 01:41:11,968 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:41:11,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-81.i [2025-02-06 01:41:11,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21f60e126/24036a6bf09b44cb9bff979db9eb5ab0/FLAGc10dc1b1f [2025-02-06 01:41:12,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/21f60e126/24036a6bf09b44cb9bff979db9eb5ab0 [2025-02-06 01:41:12,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:41:12,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:41:12,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:41:12,009 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:41:12,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:41:12,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:41:12" (1/1) ... [2025-02-06 01:41:12,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b0a6d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:12, skipping insertion in model container [2025-02-06 01:41:12,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:41:12" (1/1) ... [2025-02-06 01:41:12,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:41:12,117 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-81.i[915,928] [2025-02-06 01:41:12,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:41:12,167 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:41:12,176 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-81.i[915,928] [2025-02-06 01:41:12,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:41:12,226 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:41:12,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:12 WrapperNode [2025-02-06 01:41:12,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:41:12,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:41:12,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:41:12,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:41:12,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:12" (1/1) ... [2025-02-06 01:41:12,247 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:12" (1/1) ... [2025-02-06 01:41:12,273 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 181 [2025-02-06 01:41:12,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:41:12,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:41:12,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:41:12,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:41:12,279 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:12" (1/1) ... [2025-02-06 01:41:12,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:12" (1/1) ... [2025-02-06 01:41:12,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:12" (1/1) ... [2025-02-06 01:41:12,301 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 01:41:12,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:12" (1/1) ... [2025-02-06 01:41:12,301 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:12" (1/1) ... [2025-02-06 01:41:12,310 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:12" (1/1) ... [2025-02-06 01:41:12,311 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:12" (1/1) ... [2025-02-06 01:41:12,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:12" (1/1) ... [2025-02-06 01:41:12,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:12" (1/1) ... [2025-02-06 01:41:12,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:41:12,325 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:41:12,325 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:41:12,325 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:41:12,326 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:12" (1/1) ... [2025-02-06 01:41:12,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:41:12,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:41:12,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 01:41:12,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 01:41:12,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:41:12,368 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:41:12,368 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:41:12,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:41:12,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:41:12,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:41:12,429 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:41:12,430 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:41:12,694 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L134: havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-02-06 01:41:12,720 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-02-06 01:41:12,721 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:41:12,735 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:41:12,738 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:41:12,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:41:12 BoogieIcfgContainer [2025-02-06 01:41:12,742 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:41:12,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:41:12,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:41:12,747 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:41:12,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:41:12" (1/3) ... [2025-02-06 01:41:12,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18526ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:41:12, skipping insertion in model container [2025-02-06 01:41:12,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:41:12" (2/3) ... [2025-02-06 01:41:12,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18526ee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:41:12, skipping insertion in model container [2025-02-06 01:41:12,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:41:12" (3/3) ... [2025-02-06 01:41:12,749 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-81.i [2025-02-06 01:41:12,762 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:41:12,763 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-81.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:41:12,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:41:12,828 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;@4ff12a90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:41:12,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:41:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 01:41:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 01:41:12,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:41:12,842 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:41:12,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:41:12,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:41:12,850 INFO L85 PathProgramCache]: Analyzing trace with hash 678468176, now seen corresponding path program 1 times [2025-02-06 01:41:12,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:41:12,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371334815] [2025-02-06 01:41:12,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:41:12,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:41:12,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 01:41:12,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 01:41:12,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:41:12,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:41:13,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-06 01:41:13,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:41:13,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371334815] [2025-02-06 01:41:13,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371334815] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:41:13,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258130865] [2025-02-06 01:41:13,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:41:13,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:41:13,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:41:13,153 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:41:13,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 01:41:13,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 01:41:13,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 01:41:13,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:41:13,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:41:13,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:41:13,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:41:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-02-06 01:41:13,309 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:41:13,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258130865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:41:13,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:41:13,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:41:13,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487496882] [2025-02-06 01:41:13,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:41:13,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:41:13,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:41:13,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:41:13,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:41:13,331 INFO L87 Difference]: Start difference. First operand has 76 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 48 states have internal predecessors, (64), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:41:13,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:41:13,356 INFO L93 Difference]: Finished difference Result 149 states and 255 transitions. [2025-02-06 01:41:13,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:41:13,357 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2025-02-06 01:41:13,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:41:13,361 INFO L225 Difference]: With dead ends: 149 [2025-02-06 01:41:13,361 INFO L226 Difference]: Without dead ends: 73 [2025-02-06 01:41:13,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:41:13,365 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:41:13,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:41:13,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-06 01:41:13,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-02-06 01:41:13,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 01:41:13,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2025-02-06 01:41:13,402 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 163 [2025-02-06 01:41:13,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:41:13,403 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2025-02-06 01:41:13,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:41:13,403 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2025-02-06 01:41:13,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 01:41:13,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:41:13,405 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:41:13,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 01:41:13,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 01:41:13,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:41:13,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:41:13,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1070490352, now seen corresponding path program 1 times [2025-02-06 01:41:13,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:41:13,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070974497] [2025-02-06 01:41:13,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:41:13,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:41:13,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 01:41:13,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 01:41:13,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:41:13,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:41:22,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:41:22,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:41:22,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070974497] [2025-02-06 01:41:22,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070974497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:41:22,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:41:22,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 01:41:22,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561695997] [2025-02-06 01:41:22,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:41:22,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 01:41:22,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:41:22,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 01:41:22,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:41:22,410 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:41:24,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:41:24,669 INFO L93 Difference]: Finished difference Result 321 states and 480 transitions. [2025-02-06 01:41:24,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 01:41:24,670 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2025-02-06 01:41:24,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:41:24,673 INFO L225 Difference]: With dead ends: 321 [2025-02-06 01:41:24,673 INFO L226 Difference]: Without dead ends: 251 [2025-02-06 01:41:24,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-02-06 01:41:24,677 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 719 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:41:24,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 497 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 01:41:24,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-02-06 01:41:24,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 132. [2025-02-06 01:41:24,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 77 states have internal predecessors, (99), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 01:41:24,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 203 transitions. [2025-02-06 01:41:24,715 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 203 transitions. Word has length 163 [2025-02-06 01:41:24,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:41:24,716 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 203 transitions. [2025-02-06 01:41:24,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:41:24,716 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 203 transitions. [2025-02-06 01:41:24,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 01:41:24,717 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:41:24,717 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:41:24,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 01:41:24,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:41:24,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:41:24,718 INFO L85 PathProgramCache]: Analyzing trace with hash 873976847, now seen corresponding path program 1 times [2025-02-06 01:41:24,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:41:24,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017170325] [2025-02-06 01:41:24,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:41:24,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:41:24,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 01:41:24,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 01:41:24,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:41:24,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:41:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:41:24,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:41:24,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017170325] [2025-02-06 01:41:24,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017170325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:41:24,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:41:24,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 01:41:24,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706169501] [2025-02-06 01:41:24,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:41:24,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 01:41:24,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:41:24,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 01:41:24,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 01:41:24,901 INFO L87 Difference]: Start difference. First operand 132 states and 203 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:41:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:41:24,961 INFO L93 Difference]: Finished difference Result 237 states and 360 transitions. [2025-02-06 01:41:24,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 01:41:24,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2025-02-06 01:41:24,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:41:24,963 INFO L225 Difference]: With dead ends: 237 [2025-02-06 01:41:24,963 INFO L226 Difference]: Without dead ends: 167 [2025-02-06 01:41:24,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 01:41:24,964 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 42 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:41:24,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 318 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:41:24,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-06 01:41:24,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2025-02-06 01:41:24,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 105 states have internal predecessors, (135), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 01:41:24,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 247 transitions. [2025-02-06 01:41:24,986 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 247 transitions. Word has length 163 [2025-02-06 01:41:24,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:41:24,987 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 247 transitions. [2025-02-06 01:41:24,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:41:24,987 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 247 transitions. [2025-02-06 01:41:24,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 01:41:24,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:41:24,988 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:41:24,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 01:41:24,989 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:41:24,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:41:24,989 INFO L85 PathProgramCache]: Analyzing trace with hash -726461007, now seen corresponding path program 1 times [2025-02-06 01:41:24,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:41:24,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149103869] [2025-02-06 01:41:24,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:41:24,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:41:24,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 01:41:25,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 01:41:25,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:41:25,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:41:31,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:41:31,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:41:31,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149103869] [2025-02-06 01:41:31,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149103869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:41:31,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:41:31,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 01:41:31,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399095820] [2025-02-06 01:41:31,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:41:31,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 01:41:31,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:41:31,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 01:41:31,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:41:31,270 INFO L87 Difference]: Start difference. First operand 164 states and 247 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:41:33,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:41:33,806 INFO L93 Difference]: Finished difference Result 372 states and 546 transitions. [2025-02-06 01:41:33,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 01:41:33,807 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2025-02-06 01:41:33,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:41:33,812 INFO L225 Difference]: With dead ends: 372 [2025-02-06 01:41:33,812 INFO L226 Difference]: Without dead ends: 270 [2025-02-06 01:41:33,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2025-02-06 01:41:33,814 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 439 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 01:41:33,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 494 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 01:41:33,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-02-06 01:41:33,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 164. [2025-02-06 01:41:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 105 states have internal predecessors, (135), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 01:41:33,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 247 transitions. [2025-02-06 01:41:33,841 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 247 transitions. Word has length 163 [2025-02-06 01:41:33,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:41:33,841 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 247 transitions. [2025-02-06 01:41:33,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:41:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 247 transitions. [2025-02-06 01:41:33,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 01:41:33,843 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:41:33,843 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:41:33,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 01:41:33,843 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:41:33,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:41:33,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1199573071, now seen corresponding path program 1 times [2025-02-06 01:41:33,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:41:33,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001187134] [2025-02-06 01:41:33,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:41:33,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:41:33,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 01:41:33,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 01:41:33,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:41:33,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:41:34,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:41:34,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:41:34,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001187134] [2025-02-06 01:41:34,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001187134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:41:34,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:41:34,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 01:41:34,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052881210] [2025-02-06 01:41:34,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:41:34,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 01:41:34,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:41:34,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 01:41:34,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:41:34,227 INFO L87 Difference]: Start difference. First operand 164 states and 247 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:41:34,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:41:34,557 INFO L93 Difference]: Finished difference Result 312 states and 467 transitions. [2025-02-06 01:41:34,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 01:41:34,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2025-02-06 01:41:34,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:41:34,560 INFO L225 Difference]: With dead ends: 312 [2025-02-06 01:41:34,560 INFO L226 Difference]: Without dead ends: 210 [2025-02-06 01:41:34,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:41:34,561 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 101 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:41:34,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 429 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 01:41:34,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-06 01:41:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 170. [2025-02-06 01:41:34,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 110 states have (on average 1.290909090909091) internal successors, (142), 111 states have internal predecessors, (142), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 01:41:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 254 transitions. [2025-02-06 01:41:34,584 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 254 transitions. Word has length 163 [2025-02-06 01:41:34,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:41:34,586 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 254 transitions. [2025-02-06 01:41:34,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:41:34,586 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 254 transitions. [2025-02-06 01:41:34,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 01:41:34,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:41:34,588 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:41:34,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 01:41:34,588 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:41:34,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:41:34,591 INFO L85 PathProgramCache]: Analyzing trace with hash 564931727, now seen corresponding path program 1 times [2025-02-06 01:41:34,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:41:34,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785473236] [2025-02-06 01:41:34,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:41:34,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:41:34,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 01:41:34,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 01:41:34,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:41:34,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:41:40,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:41:40,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:41:40,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785473236] [2025-02-06 01:41:40,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785473236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:41:40,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:41:40,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 01:41:40,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054044305] [2025-02-06 01:41:40,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:41:40,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 01:41:40,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:41:40,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 01:41:40,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 01:41:40,215 INFO L87 Difference]: Start difference. First operand 170 states and 254 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:41:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:41:41,875 INFO L93 Difference]: Finished difference Result 341 states and 498 transitions. [2025-02-06 01:41:41,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 01:41:41,876 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2025-02-06 01:41:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:41:41,877 INFO L225 Difference]: With dead ends: 341 [2025-02-06 01:41:41,878 INFO L226 Difference]: Without dead ends: 239 [2025-02-06 01:41:41,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2025-02-06 01:41:41,878 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 269 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 01:41:41,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 467 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 01:41:41,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-02-06 01:41:41,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 171. [2025-02-06 01:41:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 01:41:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 256 transitions. [2025-02-06 01:41:41,890 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 256 transitions. Word has length 163 [2025-02-06 01:41:41,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:41:41,891 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 256 transitions. [2025-02-06 01:41:41,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:41:41,891 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 256 transitions. [2025-02-06 01:41:41,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 01:41:41,892 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:41:41,892 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:41:41,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 01:41:41,892 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:41:41,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:41:41,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1232019632, now seen corresponding path program 1 times [2025-02-06 01:41:41,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:41:41,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071787231] [2025-02-06 01:41:41,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:41:41,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:41:41,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 01:41:41,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 01:41:41,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:41:41,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:41:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:41:48,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:41:48,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071787231] [2025-02-06 01:41:48,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071787231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:41:48,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:41:48,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 01:41:48,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547949177] [2025-02-06 01:41:48,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:41:48,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 01:41:48,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:41:48,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 01:41:48,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-02-06 01:41:48,910 INFO L87 Difference]: Start difference. First operand 171 states and 256 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:41:49,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:41:49,343 INFO L93 Difference]: Finished difference Result 322 states and 474 transitions. [2025-02-06 01:41:49,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 01:41:49,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2025-02-06 01:41:49,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:41:49,352 INFO L225 Difference]: With dead ends: 322 [2025-02-06 01:41:49,352 INFO L226 Difference]: Without dead ends: 210 [2025-02-06 01:41:49,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-02-06 01:41:49,352 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 137 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:41:49,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 337 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 01:41:49,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-06 01:41:49,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 168. [2025-02-06 01:41:49,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 108 states have (on average 1.2962962962962963) internal successors, (140), 109 states have internal predecessors, (140), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 01:41:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2025-02-06 01:41:49,367 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 163 [2025-02-06 01:41:49,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:41:49,368 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2025-02-06 01:41:49,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:41:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2025-02-06 01:41:49,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 01:41:49,369 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:41:49,369 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:41:49,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 01:41:49,369 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:41:49,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:41:49,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1462082273, now seen corresponding path program 1 times [2025-02-06 01:41:49,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:41:49,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195745709] [2025-02-06 01:41:49,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:41:49,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:41:49,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 01:41:49,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 01:41:49,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:41:49,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:41:54,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:41:54,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:41:54,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195745709] [2025-02-06 01:41:54,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195745709] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:41:54,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:41:54,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 01:41:54,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827912765] [2025-02-06 01:41:54,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:41:54,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 01:41:54,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:41:54,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 01:41:54,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 01:41:54,130 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:41:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:41:55,109 INFO L93 Difference]: Finished difference Result 482 states and 699 transitions. [2025-02-06 01:41:55,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 01:41:55,110 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2025-02-06 01:41:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:41:55,115 INFO L225 Difference]: With dead ends: 482 [2025-02-06 01:41:55,115 INFO L226 Difference]: Without dead ends: 370 [2025-02-06 01:41:55,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2025-02-06 01:41:55,116 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 502 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 01:41:55,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 590 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 01:41:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-02-06 01:41:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 173. [2025-02-06 01:41:55,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 113 states have (on average 1.3097345132743363) internal successors, (148), 114 states have internal predecessors, (148), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 01:41:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 260 transitions. [2025-02-06 01:41:55,135 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 260 transitions. Word has length 164 [2025-02-06 01:41:55,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:41:55,135 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 260 transitions. [2025-02-06 01:41:55,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:41:55,135 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 260 transitions. [2025-02-06 01:41:55,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 01:41:55,137 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:41:55,137 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:41:55,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 01:41:55,138 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:41:55,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:41:55,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1658595778, now seen corresponding path program 1 times [2025-02-06 01:41:55,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:41:55,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774930519] [2025-02-06 01:41:55,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:41:55,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:41:55,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 01:41:55,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 01:41:55,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:41:55,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:41:59,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:41:59,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:41:59,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774930519] [2025-02-06 01:41:59,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774930519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:41:59,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:41:59,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 01:41:59,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30779268] [2025-02-06 01:41:59,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:41:59,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 01:41:59,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:41:59,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 01:41:59,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-06 01:41:59,626 INFO L87 Difference]: Start difference. First operand 173 states and 260 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:42:01,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:42:01,436 INFO L93 Difference]: Finished difference Result 448 states and 653 transitions. [2025-02-06 01:42:01,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 01:42:01,436 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2025-02-06 01:42:01,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:42:01,438 INFO L225 Difference]: With dead ends: 448 [2025-02-06 01:42:01,438 INFO L226 Difference]: Without dead ends: 336 [2025-02-06 01:42:01,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2025-02-06 01:42:01,439 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 392 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 01:42:01,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [392 Valid, 693 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 01:42:01,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-02-06 01:42:01,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 181. [2025-02-06 01:42:01,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 122 states have internal predecessors, (159), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 01:42:01,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 271 transitions. [2025-02-06 01:42:01,453 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 271 transitions. Word has length 164 [2025-02-06 01:42:01,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:42:01,453 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 271 transitions. [2025-02-06 01:42:01,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:42:01,454 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 271 transitions. [2025-02-06 01:42:01,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 01:42:01,455 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:42:01,455 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:42:01,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 01:42:01,455 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:42:01,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:42:01,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1035933664, now seen corresponding path program 1 times [2025-02-06 01:42:01,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:42:01,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204548544] [2025-02-06 01:42:01,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:42:01,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:42:01,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 01:42:01,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 01:42:01,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:42:01,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:42:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:42:06,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:42:06,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204548544] [2025-02-06 01:42:06,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204548544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:42:06,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:42:06,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 01:42:06,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640845730] [2025-02-06 01:42:06,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:42:06,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 01:42:06,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:42:06,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 01:42:06,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-06 01:42:06,946 INFO L87 Difference]: Start difference. First operand 181 states and 271 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:42:08,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:42:08,708 INFO L93 Difference]: Finished difference Result 445 states and 648 transitions. [2025-02-06 01:42:08,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 01:42:08,708 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2025-02-06 01:42:08,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:42:08,711 INFO L225 Difference]: With dead ends: 445 [2025-02-06 01:42:08,711 INFO L226 Difference]: Without dead ends: 333 [2025-02-06 01:42:08,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2025-02-06 01:42:08,712 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 440 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:42:08,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 549 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 01:42:08,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-02-06 01:42:08,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 182. [2025-02-06 01:42:08,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 122 states have (on average 1.319672131147541) internal successors, (161), 123 states have internal predecessors, (161), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 01:42:08,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 273 transitions. [2025-02-06 01:42:08,731 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 273 transitions. Word has length 164 [2025-02-06 01:42:08,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:42:08,731 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 273 transitions. [2025-02-06 01:42:08,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:42:08,731 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 273 transitions. [2025-02-06 01:42:08,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 01:42:08,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:42:08,733 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:42:08,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 01:42:08,733 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:42:08,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:42:08,734 INFO L85 PathProgramCache]: Analyzing trace with hash 839420159, now seen corresponding path program 1 times [2025-02-06 01:42:08,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:42:08,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679246998] [2025-02-06 01:42:08,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:42:08,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:42:08,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 01:42:08,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 01:42:08,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:42:08,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:42:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:42:12,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:42:12,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679246998] [2025-02-06 01:42:12,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679246998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:42:12,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:42:12,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 01:42:12,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782052218] [2025-02-06 01:42:12,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:42:12,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 01:42:12,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:42:12,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 01:42:12,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-02-06 01:42:12,692 INFO L87 Difference]: Start difference. First operand 182 states and 273 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:42:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:42:14,252 INFO L93 Difference]: Finished difference Result 420 states and 614 transitions. [2025-02-06 01:42:14,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 01:42:14,253 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2025-02-06 01:42:14,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:42:14,254 INFO L225 Difference]: With dead ends: 420 [2025-02-06 01:42:14,254 INFO L226 Difference]: Without dead ends: 308 [2025-02-06 01:42:14,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-02-06 01:42:14,255 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 253 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 01:42:14,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 665 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 01:42:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-02-06 01:42:14,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 181. [2025-02-06 01:42:14,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 122 states have internal predecessors, (159), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 01:42:14,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 271 transitions. [2025-02-06 01:42:14,268 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 271 transitions. Word has length 164 [2025-02-06 01:42:14,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:42:14,268 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 271 transitions. [2025-02-06 01:42:14,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:42:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 271 transitions. [2025-02-06 01:42:14,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 01:42:14,269 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:42:14,269 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:42:14,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 01:42:14,269 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:42:14,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:42:14,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1967640898, now seen corresponding path program 1 times [2025-02-06 01:42:14,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:42:14,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155491061] [2025-02-06 01:42:14,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:42:14,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:42:14,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 01:42:14,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 01:42:14,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:42:14,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:42:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:42:19,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:42:19,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155491061] [2025-02-06 01:42:19,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155491061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:42:19,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:42:19,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 01:42:19,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419269919] [2025-02-06 01:42:19,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:42:19,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 01:42:19,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:42:19,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 01:42:19,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:42:19,500 INFO L87 Difference]: Start difference. First operand 181 states and 271 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:42:22,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:42:22,425 INFO L93 Difference]: Finished difference Result 499 states and 719 transitions. [2025-02-06 01:42:22,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 01:42:22,426 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2025-02-06 01:42:22,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:42:22,427 INFO L225 Difference]: With dead ends: 499 [2025-02-06 01:42:22,427 INFO L226 Difference]: Without dead ends: 387 [2025-02-06 01:42:22,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2025-02-06 01:42:22,428 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 315 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:42:22,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 549 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-06 01:42:22,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-02-06 01:42:22,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 188. [2025-02-06 01:42:22,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 128 states have (on average 1.328125) internal successors, (170), 129 states have internal predecessors, (170), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 01:42:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 282 transitions. [2025-02-06 01:42:22,443 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 282 transitions. Word has length 164 [2025-02-06 01:42:22,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:42:22,444 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 282 transitions. [2025-02-06 01:42:22,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:42:22,444 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 282 transitions. [2025-02-06 01:42:22,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 01:42:22,445 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:42:22,445 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:42:22,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 01:42:22,445 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:42:22,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:42:22,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2130812893, now seen corresponding path program 1 times [2025-02-06 01:42:22,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:42:22,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637501201] [2025-02-06 01:42:22,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:42:22,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:42:22,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 01:42:22,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 01:42:22,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:42:22,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:42:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:42:22,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:42:22,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637501201] [2025-02-06 01:42:22,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637501201] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:42:22,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:42:22,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 01:42:22,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322915247] [2025-02-06 01:42:22,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:42:22,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 01:42:22,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:42:22,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 01:42:22,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:42:22,905 INFO L87 Difference]: Start difference. First operand 188 states and 282 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:42:23,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:42:23,391 INFO L93 Difference]: Finished difference Result 394 states and 581 transitions. [2025-02-06 01:42:23,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 01:42:23,392 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2025-02-06 01:42:23,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:42:23,393 INFO L225 Difference]: With dead ends: 394 [2025-02-06 01:42:23,393 INFO L226 Difference]: Without dead ends: 277 [2025-02-06 01:42:23,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-02-06 01:42:23,394 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 211 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 01:42:23,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 397 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 01:42:23,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-02-06 01:42:23,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 189. [2025-02-06 01:42:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 129 states have (on average 1.3333333333333333) internal successors, (172), 130 states have internal predecessors, (172), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 01:42:23,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 284 transitions. [2025-02-06 01:42:23,412 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 284 transitions. Word has length 164 [2025-02-06 01:42:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:42:23,413 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 284 transitions. [2025-02-06 01:42:23,413 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:42:23,413 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 284 transitions. [2025-02-06 01:42:23,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 01:42:23,415 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:42:23,415 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:42:23,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 01:42:23,415 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:42:23,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:42:23,416 INFO L85 PathProgramCache]: Analyzing trace with hash 530375039, now seen corresponding path program 1 times [2025-02-06 01:42:23,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:42:23,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605637515] [2025-02-06 01:42:23,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:42:23,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:42:23,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 01:42:23,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 01:42:23,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:42:23,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:42:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:42:27,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:42:27,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605637515] [2025-02-06 01:42:27,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605637515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:42:27,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:42:27,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 01:42:27,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336231625] [2025-02-06 01:42:27,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:42:27,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 01:42:27,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:42:27,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 01:42:27,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 01:42:27,871 INFO L87 Difference]: Start difference. First operand 189 states and 284 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:42:28,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:42:28,679 INFO L93 Difference]: Finished difference Result 395 states and 583 transitions. [2025-02-06 01:42:28,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 01:42:28,679 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2025-02-06 01:42:28,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:42:28,681 INFO L225 Difference]: With dead ends: 395 [2025-02-06 01:42:28,681 INFO L226 Difference]: Without dead ends: 278 [2025-02-06 01:42:28,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-02-06 01:42:28,682 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 203 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 01:42:28,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 422 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 01:42:28,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-02-06 01:42:28,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 186. [2025-02-06 01:42:28,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 126 states have (on average 1.3333333333333333) internal successors, (168), 127 states have internal predecessors, (168), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 01:42:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 280 transitions. [2025-02-06 01:42:28,700 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 280 transitions. Word has length 164 [2025-02-06 01:42:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:42:28,700 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 280 transitions. [2025-02-06 01:42:28,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:42:28,701 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 280 transitions. [2025-02-06 01:42:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 01:42:28,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:42:28,702 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:42:28,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 01:42:28,702 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:42:28,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:42:28,703 INFO L85 PathProgramCache]: Analyzing trace with hash 45469536, now seen corresponding path program 1 times [2025-02-06 01:42:28,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:42:28,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296789944] [2025-02-06 01:42:28,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:42:28,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:42:28,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 01:42:28,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 01:42:28,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:42:28,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:42:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:42:28,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:42:28,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296789944] [2025-02-06 01:42:28,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296789944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:42:28,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:42:28,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 01:42:28,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145694499] [2025-02-06 01:42:28,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:42:28,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 01:42:28,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:42:28,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 01:42:28,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 01:42:28,798 INFO L87 Difference]: Start difference. First operand 186 states and 280 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:42:28,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:42:28,857 INFO L93 Difference]: Finished difference Result 334 states and 493 transitions. [2025-02-06 01:42:28,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 01:42:28,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2025-02-06 01:42:28,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:42:28,859 INFO L225 Difference]: With dead ends: 334 [2025-02-06 01:42:28,859 INFO L226 Difference]: Without dead ends: 217 [2025-02-06 01:42:28,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 01:42:28,860 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 61 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:42:28,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 323 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:42:28,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-02-06 01:42:28,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 173. [2025-02-06 01:42:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 116 states have (on average 1.3275862068965518) internal successors, (154), 116 states have internal predecessors, (154), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 01:42:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 258 transitions. [2025-02-06 01:42:28,872 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 258 transitions. Word has length 164 [2025-02-06 01:42:28,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:42:28,872 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 258 transitions. [2025-02-06 01:42:28,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-02-06 01:42:28,873 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 258 transitions. [2025-02-06 01:42:28,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 01:42:28,873 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:42:28,873 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:42:28,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 01:42:28,874 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:42:28,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:42:28,874 INFO L85 PathProgramCache]: Analyzing trace with hash -151043969, now seen corresponding path program 1 times [2025-02-06 01:42:28,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:42:28,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453256454] [2025-02-06 01:42:28,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:42:28,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:42:28,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 01:42:28,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 01:42:28,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:42:28,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:42:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-02-06 01:42:35,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:42:35,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453256454] [2025-02-06 01:42:35,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453256454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:42:35,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:42:35,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 01:42:35,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157741668] [2025-02-06 01:42:35,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:42:35,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 01:42:35,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:42:35,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 01:42:35,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-02-06 01:42:35,599 INFO L87 Difference]: Start difference. First operand 173 states and 258 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:42:36,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:42:36,575 INFO L93 Difference]: Finished difference Result 337 states and 492 transitions. [2025-02-06 01:42:36,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 01:42:36,576 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2025-02-06 01:42:36,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:42:36,578 INFO L225 Difference]: With dead ends: 337 [2025-02-06 01:42:36,578 INFO L226 Difference]: Without dead ends: 235 [2025-02-06 01:42:36,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2025-02-06 01:42:36,580 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 321 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 01:42:36,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 473 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 01:42:36,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-02-06 01:42:36,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 175. [2025-02-06 01:42:36,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 118 states have (on average 1.3305084745762712) internal successors, (157), 118 states have internal predecessors, (157), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 01:42:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 261 transitions. [2025-02-06 01:42:36,592 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 261 transitions. Word has length 164 [2025-02-06 01:42:36,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:42:36,593 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 261 transitions. [2025-02-06 01:42:36,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-02-06 01:42:36,593 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 261 transitions. [2025-02-06 01:42:36,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 01:42:36,594 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:42:36,594 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:42:36,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 01:42:36,594 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:42:36,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:42:36,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1947995328, now seen corresponding path program 1 times [2025-02-06 01:42:36,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:42:36,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705635062] [2025-02-06 01:42:36,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:42:36,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:42:36,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 01:42:36,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 01:42:36,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:42:36,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat