./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56df4eb5f1ce718ca5531ff4f8afda450f18f02286533668c4676eba9d6cba09 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:40:08,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:40:08,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:40:08,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:40:08,263 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:40:08,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:40:08,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:40:08,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:40:08,280 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:40:08,280 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:40:08,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:40:08,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:40:08,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:40:08,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:40:08,281 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:40:08,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:40:08,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:40:08,282 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:40:08,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:40:08,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:40:08,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:40:08,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:40:08,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:40:08,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:40:08,282 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:40:08,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:40:08,282 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:40:08,283 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:40:08,283 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:40:08,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:40:08,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:40:08,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:40:08,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:40:08,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:40:08,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:40:08,283 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:40:08,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:40:08,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:40:08,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:40:08,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:40:08,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:40:08,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:40:08,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:40:08,284 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 56df4eb5f1ce718ca5531ff4f8afda450f18f02286533668c4676eba9d6cba09 [2025-03-17 01:40:08,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:40:08,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:40:08,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:40:08,500 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:40:08,500 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:40:08,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-86.i [2025-03-17 01:40:09,618 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc62a9610/a4b1485fdca04197a96d679edbbadc66/FLAG400914292 [2025-03-17 01:40:09,840 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:40:09,841 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-86.i [2025-03-17 01:40:09,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc62a9610/a4b1485fdca04197a96d679edbbadc66/FLAG400914292 [2025-03-17 01:40:10,178 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc62a9610/a4b1485fdca04197a96d679edbbadc66 [2025-03-17 01:40:10,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:40:10,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:40:10,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:40:10,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:40:10,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:40:10,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:40:10" (1/1) ... [2025-03-17 01:40:10,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b48a29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:10, skipping insertion in model container [2025-03-17 01:40:10,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:40:10" (1/1) ... [2025-03-17 01:40:10,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:40:10,301 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-86.i[919,932] [2025-03-17 01:40:10,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:40:10,380 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:40:10,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-86.i[919,932] [2025-03-17 01:40:10,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:40:10,438 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:40:10,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:10 WrapperNode [2025-03-17 01:40:10,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:40:10,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:40:10,441 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:40:10,441 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:40:10,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:10" (1/1) ... [2025-03-17 01:40:10,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:10" (1/1) ... [2025-03-17 01:40:10,491 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2025-03-17 01:40:10,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:40:10,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:40:10,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:40:10,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:40:10,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:10" (1/1) ... [2025-03-17 01:40:10,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:10" (1/1) ... [2025-03-17 01:40:10,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:10" (1/1) ... [2025-03-17 01:40:10,531 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 01:40:10,533 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:10" (1/1) ... [2025-03-17 01:40:10,534 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:10" (1/1) ... [2025-03-17 01:40:10,543 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:10" (1/1) ... [2025-03-17 01:40:10,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:10" (1/1) ... [2025-03-17 01:40:10,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:10" (1/1) ... [2025-03-17 01:40:10,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:10" (1/1) ... [2025-03-17 01:40:10,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:40:10,560 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:40:10,560 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:40:10,560 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:40:10,561 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:10" (1/1) ... [2025-03-17 01:40:10,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:40:10,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:40:10,584 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 01:40:10,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 01:40:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:40:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:40:10,604 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:40:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:40:10,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:40:10,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:40:10,670 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:40:10,672 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:40:11,034 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-17 01:40:11,034 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:40:11,050 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:40:11,051 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:40:11,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:40:11 BoogieIcfgContainer [2025-03-17 01:40:11,052 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:40:11,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:40:11,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:40:11,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:40:11,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:40:10" (1/3) ... [2025-03-17 01:40:11,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e843ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:40:11, skipping insertion in model container [2025-03-17 01:40:11,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:40:10" (2/3) ... [2025-03-17 01:40:11,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e843ef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:40:11, skipping insertion in model container [2025-03-17 01:40:11,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:40:11" (3/3) ... [2025-03-17 01:40:11,060 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-86.i [2025-03-17 01:40:11,071 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:40:11,073 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-86.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:40:11,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:40:11,123 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;@5a3aca5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:40:11,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:40:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 63 states have (on average 1.507936507936508) internal successors, (95), 64 states have internal predecessors, (95), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 01:40:11,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 01:40:11,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:11,137 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:11,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:11,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:11,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1497900883, now seen corresponding path program 1 times [2025-03-17 01:40:11,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:11,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759287230] [2025-03-17 01:40:11,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:11,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:11,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 01:40:11,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 01:40:11,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:11,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:11,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-17 01:40:11,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:11,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759287230] [2025-03-17 01:40:11,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759287230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:40:11,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196713754] [2025-03-17 01:40:11,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:11,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:40:11,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:40:11,441 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:40:11,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 01:40:11,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 01:40:11,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 01:40:11,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:11,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:11,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:40:11,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:40:11,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-17 01:40:11,598 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:40:11,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196713754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:11,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:40:11,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:40:11,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200658768] [2025-03-17 01:40:11,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:11,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:40:11,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:11,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:40:11,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:40:11,624 INFO L87 Difference]: Start difference. First operand has 97 states, 63 states have (on average 1.507936507936508) internal successors, (95), 64 states have internal predecessors, (95), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 01:40:11,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:11,662 INFO L93 Difference]: Finished difference Result 191 states and 343 transitions. [2025-03-17 01:40:11,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:40:11,664 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 192 [2025-03-17 01:40:11,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:11,669 INFO L225 Difference]: With dead ends: 191 [2025-03-17 01:40:11,670 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 01:40:11,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:40:11,678 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:11,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:40:11,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 01:40:11,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-17 01:40:11,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 62 states have internal predecessors, (90), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 01:40:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 152 transitions. [2025-03-17 01:40:11,719 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 152 transitions. Word has length 192 [2025-03-17 01:40:11,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:11,720 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 152 transitions. [2025-03-17 01:40:11,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 01:40:11,721 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 152 transitions. [2025-03-17 01:40:11,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 01:40:11,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:11,723 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:11,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 01:40:11,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 01:40:11,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:11,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:11,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1671674740, now seen corresponding path program 1 times [2025-03-17 01:40:11,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:11,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988067273] [2025-03-17 01:40:11,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:11,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:11,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 01:40:11,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 01:40:11,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:11,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:12,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:40:12,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:12,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988067273] [2025-03-17 01:40:12,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988067273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:12,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:40:12,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:40:12,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420473036] [2025-03-17 01:40:12,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:12,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:40:12,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:12,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:40:12,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:40:12,215 INFO L87 Difference]: Start difference. First operand 95 states and 152 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:40:12,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:12,254 INFO L93 Difference]: Finished difference Result 190 states and 305 transitions. [2025-03-17 01:40:12,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:40:12,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 192 [2025-03-17 01:40:12,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:12,259 INFO L225 Difference]: With dead ends: 190 [2025-03-17 01:40:12,260 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 01:40:12,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:40:12,262 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:12,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:40:12,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 01:40:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-17 01:40:12,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 63 states have internal predecessors, (91), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 01:40:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 153 transitions. [2025-03-17 01:40:12,275 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 153 transitions. Word has length 192 [2025-03-17 01:40:12,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:12,277 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 153 transitions. [2025-03-17 01:40:12,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:40:12,278 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 153 transitions. [2025-03-17 01:40:12,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 01:40:12,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:12,281 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:12,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:40:12,282 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:12,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:12,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1166116115, now seen corresponding path program 1 times [2025-03-17 01:40:12,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:12,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695715753] [2025-03-17 01:40:12,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:12,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:12,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 01:40:12,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 01:40:12,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:12,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:12,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:40:12,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:12,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695715753] [2025-03-17 01:40:12,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695715753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:12,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:40:12,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 01:40:12,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237494498] [2025-03-17 01:40:12,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:12,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 01:40:12,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:12,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 01:40:12,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:40:12,538 INFO L87 Difference]: Start difference. First operand 96 states and 153 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:40:12,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:12,767 INFO L93 Difference]: Finished difference Result 287 states and 458 transitions. [2025-03-17 01:40:12,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:40:12,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 192 [2025-03-17 01:40:12,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:12,773 INFO L225 Difference]: With dead ends: 287 [2025-03-17 01:40:12,774 INFO L226 Difference]: Without dead ends: 192 [2025-03-17 01:40:12,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:40:12,775 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 149 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:12,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 504 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:40:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-17 01:40:12,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 148. [2025-03-17 01:40:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 83 states have (on average 1.3373493975903614) internal successors, (111), 83 states have internal predecessors, (111), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 01:40:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 235 transitions. [2025-03-17 01:40:12,805 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 235 transitions. Word has length 192 [2025-03-17 01:40:12,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:12,807 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 235 transitions. [2025-03-17 01:40:12,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:40:12,807 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 235 transitions. [2025-03-17 01:40:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 01:40:12,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:12,811 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:12,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:40:12,811 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:12,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:12,811 INFO L85 PathProgramCache]: Analyzing trace with hash 757291890, now seen corresponding path program 1 times [2025-03-17 01:40:12,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:12,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219253227] [2025-03-17 01:40:12,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:12,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:12,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 01:40:12,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 01:40:12,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:12,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:40:17,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:17,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219253227] [2025-03-17 01:40:17,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219253227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:17,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:40:17,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 01:40:17,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477468408] [2025-03-17 01:40:17,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:17,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 01:40:17,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:17,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 01:40:17,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-17 01:40:17,009 INFO L87 Difference]: Start difference. First operand 148 states and 235 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:40:17,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:17,969 INFO L93 Difference]: Finished difference Result 383 states and 606 transitions. [2025-03-17 01:40:17,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 01:40:17,970 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 192 [2025-03-17 01:40:17,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:17,972 INFO L225 Difference]: With dead ends: 383 [2025-03-17 01:40:17,972 INFO L226 Difference]: Without dead ends: 288 [2025-03-17 01:40:17,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=471, Unknown=0, NotChecked=0, Total=650 [2025-03-17 01:40:17,973 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 664 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:17,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 975 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 01:40:17,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2025-03-17 01:40:18,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 189. [2025-03-17 01:40:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 124 states have (on average 1.4112903225806452) internal successors, (175), 124 states have internal predecessors, (175), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 01:40:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 299 transitions. [2025-03-17 01:40:18,009 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 299 transitions. Word has length 192 [2025-03-17 01:40:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:18,010 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 299 transitions. [2025-03-17 01:40:18,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:40:18,010 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 299 transitions. [2025-03-17 01:40:18,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 01:40:18,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:18,013 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:18,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:40:18,013 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:18,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:18,015 INFO L85 PathProgramCache]: Analyzing trace with hash 463888883, now seen corresponding path program 1 times [2025-03-17 01:40:18,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:18,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904782320] [2025-03-17 01:40:18,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:18,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:18,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 01:40:18,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 01:40:18,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:18,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:18,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:40:18,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:18,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904782320] [2025-03-17 01:40:18,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904782320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:18,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:40:18,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:40:18,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572345939] [2025-03-17 01:40:18,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:18,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:40:18,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:18,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:40:18,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:40:18,087 INFO L87 Difference]: Start difference. First operand 189 states and 299 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:40:18,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:18,162 INFO L93 Difference]: Finished difference Result 378 states and 601 transitions. [2025-03-17 01:40:18,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:40:18,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 192 [2025-03-17 01:40:18,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:18,165 INFO L225 Difference]: With dead ends: 378 [2025-03-17 01:40:18,165 INFO L226 Difference]: Without dead ends: 283 [2025-03-17 01:40:18,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:40:18,166 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 144 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:18,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 332 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:40:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-17 01:40:18,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2025-03-17 01:40:18,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 184 states have (on average 1.4076086956521738) internal successors, (259), 184 states have internal predecessors, (259), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 01:40:18,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 445 transitions. [2025-03-17 01:40:18,204 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 445 transitions. Word has length 192 [2025-03-17 01:40:18,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:18,206 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 445 transitions. [2025-03-17 01:40:18,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:40:18,207 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 445 transitions. [2025-03-17 01:40:18,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-17 01:40:18,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:18,210 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:18,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 01:40:18,210 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:18,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:18,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2089067725, now seen corresponding path program 1 times [2025-03-17 01:40:18,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:18,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67342423] [2025-03-17 01:40:18,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:18,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:18,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 01:40:18,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 01:40:18,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:18,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:40:21,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:21,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67342423] [2025-03-17 01:40:21,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67342423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:21,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:40:21,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-17 01:40:21,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958907296] [2025-03-17 01:40:21,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:21,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 01:40:21,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:21,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 01:40:21,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:40:21,209 INFO L87 Difference]: Start difference. First operand 281 states and 445 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:40:22,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:22,162 INFO L93 Difference]: Finished difference Result 364 states and 563 transitions. [2025-03-17 01:40:22,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 01:40:22,164 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 193 [2025-03-17 01:40:22,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:22,166 INFO L225 Difference]: With dead ends: 364 [2025-03-17 01:40:22,166 INFO L226 Difference]: Without dead ends: 362 [2025-03-17 01:40:22,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2025-03-17 01:40:22,169 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 633 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:22,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 966 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 01:40:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-17 01:40:22,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 282. [2025-03-17 01:40:22,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 185 states have (on average 1.4054054054054055) internal successors, (260), 185 states have internal predecessors, (260), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 01:40:22,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 446 transitions. [2025-03-17 01:40:22,203 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 446 transitions. Word has length 193 [2025-03-17 01:40:22,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:22,204 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 446 transitions. [2025-03-17 01:40:22,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:40:22,204 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 446 transitions. [2025-03-17 01:40:22,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-17 01:40:22,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:22,206 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:22,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 01:40:22,206 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:22,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:22,206 INFO L85 PathProgramCache]: Analyzing trace with hash 530277130, now seen corresponding path program 1 times [2025-03-17 01:40:22,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:22,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148566293] [2025-03-17 01:40:22,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:22,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:22,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 01:40:22,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 01:40:22,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:22,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:22,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:40:22,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:22,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148566293] [2025-03-17 01:40:22,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148566293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:22,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:40:22,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:40:22,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574861550] [2025-03-17 01:40:22,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:22,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:40:22,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:22,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:40:22,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:40:22,435 INFO L87 Difference]: Start difference. First operand 282 states and 446 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:40:22,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:22,506 INFO L93 Difference]: Finished difference Result 492 states and 773 transitions. [2025-03-17 01:40:22,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:40:22,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 193 [2025-03-17 01:40:22,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:22,509 INFO L225 Difference]: With dead ends: 492 [2025-03-17 01:40:22,509 INFO L226 Difference]: Without dead ends: 302 [2025-03-17 01:40:22,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:40:22,511 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 54 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:22,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 409 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:40:22,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-17 01:40:22,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 290. [2025-03-17 01:40:22,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 191 states have internal predecessors, (263), 93 states have call successors, (93), 5 states have call predecessors, (93), 5 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 01:40:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 449 transitions. [2025-03-17 01:40:22,541 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 449 transitions. Word has length 193 [2025-03-17 01:40:22,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:22,542 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 449 transitions. [2025-03-17 01:40:22,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:40:22,542 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 449 transitions. [2025-03-17 01:40:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-17 01:40:22,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:22,545 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:22,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 01:40:22,545 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:22,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:22,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1417780811, now seen corresponding path program 1 times [2025-03-17 01:40:22,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:22,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005045895] [2025-03-17 01:40:22,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:22,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:22,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 01:40:22,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 01:40:22,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:22,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:40:25,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:25,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005045895] [2025-03-17 01:40:25,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005045895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:25,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:40:25,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 01:40:25,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170490225] [2025-03-17 01:40:25,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:25,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 01:40:25,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:25,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 01:40:25,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-03-17 01:40:25,140 INFO L87 Difference]: Start difference. First operand 290 states and 449 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-17 01:40:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:26,045 INFO L93 Difference]: Finished difference Result 372 states and 564 transitions. [2025-03-17 01:40:26,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 01:40:26,048 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 193 [2025-03-17 01:40:26,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:26,050 INFO L225 Difference]: With dead ends: 372 [2025-03-17 01:40:26,050 INFO L226 Difference]: Without dead ends: 370 [2025-03-17 01:40:26,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=222, Invalid=648, Unknown=0, NotChecked=0, Total=870 [2025-03-17 01:40:26,051 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 832 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:26,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 1018 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 01:40:26,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-17 01:40:26,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 290. [2025-03-17 01:40:26,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 191 states have internal predecessors, (263), 93 states have call successors, (93), 5 states have call predecessors, (93), 5 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 01:40:26,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 449 transitions. [2025-03-17 01:40:26,076 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 449 transitions. Word has length 193 [2025-03-17 01:40:26,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:26,076 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 449 transitions. [2025-03-17 01:40:26,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-17 01:40:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 449 transitions. [2025-03-17 01:40:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-17 01:40:26,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:26,078 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:26,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 01:40:26,078 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:26,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:26,079 INFO L85 PathProgramCache]: Analyzing trace with hash -916658146, now seen corresponding path program 1 times [2025-03-17 01:40:26,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:26,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264262079] [2025-03-17 01:40:26,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:26,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:26,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 01:40:26,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 01:40:26,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:26,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:40:30,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:30,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264262079] [2025-03-17 01:40:30,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264262079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:30,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:40:30,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 01:40:30,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859986751] [2025-03-17 01:40:30,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:30,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 01:40:30,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:30,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 01:40:30,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:40:30,014 INFO L87 Difference]: Start difference. First operand 290 states and 449 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:40:31,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:31,682 INFO L93 Difference]: Finished difference Result 402 states and 606 transitions. [2025-03-17 01:40:31,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 01:40:31,683 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 193 [2025-03-17 01:40:31,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:31,685 INFO L225 Difference]: With dead ends: 402 [2025-03-17 01:40:31,685 INFO L226 Difference]: Without dead ends: 400 [2025-03-17 01:40:31,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=301, Invalid=755, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 01:40:31,686 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 668 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:31,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 949 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 01:40:31,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2025-03-17 01:40:31,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 308. [2025-03-17 01:40:31,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 209 states have (on average 1.3923444976076556) internal successors, (291), 209 states have internal predecessors, (291), 93 states have call successors, (93), 5 states have call predecessors, (93), 5 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 01:40:31,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 477 transitions. [2025-03-17 01:40:31,703 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 477 transitions. Word has length 193 [2025-03-17 01:40:31,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:31,704 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 477 transitions. [2025-03-17 01:40:31,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:40:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 477 transitions. [2025-03-17 01:40:31,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-17 01:40:31,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:31,709 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:31,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 01:40:31,709 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:31,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:31,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1581357791, now seen corresponding path program 1 times [2025-03-17 01:40:31,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:31,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150533] [2025-03-17 01:40:31,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:31,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:31,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 01:40:31,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 01:40:31,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:31,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:37,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:40:37,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:37,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150533] [2025-03-17 01:40:37,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:37,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:40:37,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 01:40:37,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171492892] [2025-03-17 01:40:37,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:37,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 01:40:37,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:37,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 01:40:37,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:40:37,182 INFO L87 Difference]: Start difference. First operand 308 states and 477 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:40:43,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:43,006 INFO L93 Difference]: Finished difference Result 396 states and 600 transitions. [2025-03-17 01:40:43,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 01:40:43,008 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 193 [2025-03-17 01:40:43,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:43,010 INFO L225 Difference]: With dead ends: 396 [2025-03-17 01:40:43,010 INFO L226 Difference]: Without dead ends: 394 [2025-03-17 01:40:43,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=312, Invalid=680, Unknown=0, NotChecked=0, Total=992 [2025-03-17 01:40:43,011 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 494 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:43,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 899 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 01:40:43,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-17 01:40:43,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 308. [2025-03-17 01:40:43,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 209 states have (on average 1.3923444976076556) internal successors, (291), 209 states have internal predecessors, (291), 93 states have call successors, (93), 5 states have call predecessors, (93), 5 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 01:40:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 477 transitions. [2025-03-17 01:40:43,030 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 477 transitions. Word has length 193 [2025-03-17 01:40:43,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:43,031 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 477 transitions. [2025-03-17 01:40:43,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:40:43,031 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 477 transitions. [2025-03-17 01:40:43,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-17 01:40:43,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:43,033 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:43,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 01:40:43,033 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:43,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:43,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1089387796, now seen corresponding path program 1 times [2025-03-17 01:40:43,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:43,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721749832] [2025-03-17 01:40:43,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:43,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:43,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 01:40:43,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 01:40:43,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:43,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:40:47,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:47,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721749832] [2025-03-17 01:40:47,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721749832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:47,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:40:47,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 01:40:47,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711422008] [2025-03-17 01:40:47,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:47,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 01:40:47,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:47,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 01:40:47,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:40:47,664 INFO L87 Difference]: Start difference. First operand 308 states and 477 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:40:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:40:50,258 INFO L93 Difference]: Finished difference Result 376 states and 571 transitions. [2025-03-17 01:40:50,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 01:40:50,259 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 194 [2025-03-17 01:40:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:40:50,262 INFO L225 Difference]: With dead ends: 376 [2025-03-17 01:40:50,262 INFO L226 Difference]: Without dead ends: 374 [2025-03-17 01:40:50,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2025-03-17 01:40:50,264 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 522 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:40:50,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 938 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 01:40:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-17 01:40:50,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 305. [2025-03-17 01:40:50,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 206 states have (on average 1.3932038834951457) internal successors, (287), 206 states have internal predecessors, (287), 93 states have call successors, (93), 5 states have call predecessors, (93), 5 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 01:40:50,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 473 transitions. [2025-03-17 01:40:50,283 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 473 transitions. Word has length 194 [2025-03-17 01:40:50,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:40:50,284 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 473 transitions. [2025-03-17 01:40:50,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:40:50,284 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 473 transitions. [2025-03-17 01:40:50,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-17 01:40:50,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:40:50,286 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:40:50,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 01:40:50,286 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:40:50,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:40:50,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1737147682, now seen corresponding path program 1 times [2025-03-17 01:40:50,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:40:50,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709471779] [2025-03-17 01:40:50,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:40:50,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:40:50,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 01:40:50,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 01:40:50,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:40:50,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:40:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:40:57,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:40:57,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709471779] [2025-03-17 01:40:57,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709471779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:40:57,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:40:57,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 01:40:57,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002273849] [2025-03-17 01:40:57,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:40:57,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 01:40:57,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:40:57,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 01:40:57,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:40:57,234 INFO L87 Difference]: Start difference. First operand 305 states and 473 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:41:07,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:41:07,289 INFO L93 Difference]: Finished difference Result 397 states and 601 transitions. [2025-03-17 01:41:07,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 01:41:07,290 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 194 [2025-03-17 01:41:07,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:41:07,292 INFO L225 Difference]: With dead ends: 397 [2025-03-17 01:41:07,292 INFO L226 Difference]: Without dead ends: 395 [2025-03-17 01:41:07,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=325, Invalid=731, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 01:41:07,293 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 510 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-17 01:41:07,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 954 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-17 01:41:07,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2025-03-17 01:41:07,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 317. [2025-03-17 01:41:07,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 218 states have (on average 1.4036697247706422) internal successors, (306), 218 states have internal predecessors, (306), 93 states have call successors, (93), 5 states have call predecessors, (93), 5 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 01:41:07,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 492 transitions. [2025-03-17 01:41:07,324 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 492 transitions. Word has length 194 [2025-03-17 01:41:07,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:41:07,325 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 492 transitions. [2025-03-17 01:41:07,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:41:07,325 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 492 transitions. [2025-03-17 01:41:07,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-17 01:41:07,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:41:07,326 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:41:07,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 01:41:07,326 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:41:07,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:41:07,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1064937247, now seen corresponding path program 1 times [2025-03-17 01:41:07,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:41:07,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119185779] [2025-03-17 01:41:07,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:41:07,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:41:07,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 01:41:07,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 01:41:07,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:41:07,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:41:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:41:11,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:41:11,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119185779] [2025-03-17 01:41:11,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119185779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:41:11,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:41:11,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-17 01:41:11,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594146485] [2025-03-17 01:41:11,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:41:11,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 01:41:11,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:41:11,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 01:41:11,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:41:11,651 INFO L87 Difference]: Start difference. First operand 317 states and 492 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:41:14,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:41:14,327 INFO L93 Difference]: Finished difference Result 403 states and 609 transitions. [2025-03-17 01:41:14,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 01:41:14,328 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 194 [2025-03-17 01:41:14,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:41:14,330 INFO L225 Difference]: With dead ends: 403 [2025-03-17 01:41:14,330 INFO L226 Difference]: Without dead ends: 401 [2025-03-17 01:41:14,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=395, Invalid=937, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 01:41:14,331 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 553 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 01:41:14,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1068 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 01:41:14,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-17 01:41:14,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 318. [2025-03-17 01:41:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 219 states have (on average 1.4018264840182648) internal successors, (307), 219 states have internal predecessors, (307), 93 states have call successors, (93), 5 states have call predecessors, (93), 5 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 01:41:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 493 transitions. [2025-03-17 01:41:14,349 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 493 transitions. Word has length 194 [2025-03-17 01:41:14,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:41:14,350 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 493 transitions. [2025-03-17 01:41:14,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:41:14,350 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 493 transitions. [2025-03-17 01:41:14,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-17 01:41:14,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:41:14,351 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:41:14,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 01:41:14,352 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:41:14,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:41:14,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1866230401, now seen corresponding path program 1 times [2025-03-17 01:41:14,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:41:14,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317961590] [2025-03-17 01:41:14,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:41:14,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:41:14,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 01:41:14,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 01:41:14,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:41:14,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:41:19,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:41:19,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:41:19,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317961590] [2025-03-17 01:41:19,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317961590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:41:19,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:41:19,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-17 01:41:19,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179114693] [2025-03-17 01:41:19,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:41:19,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 01:41:19,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:41:19,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 01:41:19,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-03-17 01:41:19,369 INFO L87 Difference]: Start difference. First operand 318 states and 493 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:41:21,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:41:21,155 INFO L93 Difference]: Finished difference Result 393 states and 597 transitions. [2025-03-17 01:41:21,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 01:41:21,156 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 194 [2025-03-17 01:41:21,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:41:21,158 INFO L225 Difference]: With dead ends: 393 [2025-03-17 01:41:21,158 INFO L226 Difference]: Without dead ends: 391 [2025-03-17 01:41:21,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 01:41:21,158 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 493 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 01:41:21,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 1112 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 01:41:21,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-17 01:41:21,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 318. [2025-03-17 01:41:21,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 219 states have (on average 1.4018264840182648) internal successors, (307), 219 states have internal predecessors, (307), 93 states have call successors, (93), 5 states have call predecessors, (93), 5 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 01:41:21,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 493 transitions. [2025-03-17 01:41:21,174 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 493 transitions. Word has length 194 [2025-03-17 01:41:21,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:41:21,175 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 493 transitions. [2025-03-17 01:41:21,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:41:21,175 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 493 transitions. [2025-03-17 01:41:21,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-17 01:41:21,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:41:21,176 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:41:21,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 01:41:21,176 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:41:21,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:41:21,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1194019966, now seen corresponding path program 1 times [2025-03-17 01:41:21,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:41:21,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721483364] [2025-03-17 01:41:21,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:41:21,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:41:21,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 01:41:21,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 01:41:21,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:41:21,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:41:25,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:41:25,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:41:25,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721483364] [2025-03-17 01:41:25,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721483364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:41:25,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:41:25,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-17 01:41:25,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259218088] [2025-03-17 01:41:25,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:41:25,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 01:41:25,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:41:25,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 01:41:25,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-03-17 01:41:25,737 INFO L87 Difference]: Start difference. First operand 318 states and 493 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-17 01:41:27,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:41:27,839 INFO L93 Difference]: Finished difference Result 392 states and 595 transitions. [2025-03-17 01:41:27,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 01:41:27,840 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 194 [2025-03-17 01:41:27,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:41:27,842 INFO L225 Difference]: With dead ends: 392 [2025-03-17 01:41:27,842 INFO L226 Difference]: Without dead ends: 390 [2025-03-17 01:41:27,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=440, Invalid=1120, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 01:41:27,843 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 551 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 01:41:27,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1168 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 01:41:27,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-17 01:41:27,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 309. [2025-03-17 01:41:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 210 states have (on average 1.3904761904761904) internal successors, (292), 210 states have internal predecessors, (292), 93 states have call successors, (93), 5 states have call predecessors, (93), 5 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-17 01:41:27,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 478 transitions. [2025-03-17 01:41:27,862 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 478 transitions. Word has length 194 [2025-03-17 01:41:27,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:41:27,862 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 478 transitions. [2025-03-17 01:41:27,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 states have internal predecessors, (42), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-17 01:41:27,862 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 478 transitions. [2025-03-17 01:41:27,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-17 01:41:27,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:41:27,864 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:41:27,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 01:41:27,864 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:41:27,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:41:27,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1714947529, now seen corresponding path program 1 times [2025-03-17 01:41:27,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:41:27,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219217551] [2025-03-17 01:41:27,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:41:27,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:41:27,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 01:41:27,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 01:41:27,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:41:27,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:41:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:41:36,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:41:36,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219217551] [2025-03-17 01:41:36,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219217551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:41:36,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:41:36,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-17 01:41:36,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681271001] [2025-03-17 01:41:36,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:41:36,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 01:41:36,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:41:36,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 01:41:36,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2025-03-17 01:41:36,137 INFO L87 Difference]: Start difference. First operand 309 states and 478 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 3 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31)